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-171620117700039.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-02b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620117700039
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.2K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 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 417K 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-02b-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2023-01
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2023-03
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2023-06
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-07
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-08
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-10
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2023-11
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-13
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716228851181

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-20 18:14:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 18:14:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 18:14:13] [INFO ] Load time of PNML (sax parser for PT used): 246 ms
[2024-05-20 18:14:13] [INFO ] Transformed 1242 places.
[2024-05-20 18:14:13] [INFO ] Transformed 1621 transitions.
[2024-05-20 18:14:13] [INFO ] Found NUPN structural information;
[2024-05-20 18:14:13] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 465 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (159 resets) in 2057 ms. (19 steps per ms) remains 10/16 properties
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (32 resets) in 889 ms. (44 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (32 resets) in 288 ms. (138 steps per ms) remains 10/10 properties
[2024-05-20 18:14:15] [INFO ] Flatten gal took : 580 ms
BEST_FIRST walk for 40003 steps (35 resets) in 1010 ms. (39 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (32 resets) in 505 ms. (79 steps per ms) remains 10/10 properties
[2024-05-20 18:14:15] [INFO ] Flatten gal took : 261 ms
BEST_FIRST walk for 40002 steps (31 resets) in 228 ms. (174 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (34 resets) in 162 ms. (245 steps per ms) remains 10/10 properties
[2024-05-20 18:14:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8110139078969245772.gal : 145 ms
[2024-05-20 18:14:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1283202961471310768.prop : 4 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/ReachabilityCardinality8110139078969245772.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1283202961471310768.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (38 resets) in 670 ms. (59 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (36 resets) in 95 ms. (416 steps per ms) remains 10/10 properties

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 ...328
BEST_FIRST walk for 40002 steps (26 resets) in 287 ms. (138 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (32 resets) in 311 ms. (128 steps per ms) remains 10/10 properties
// Phase 1: matrix 1621 rows 1242 cols
Loading property file /tmp/ReachabilityCardinality1283202961471310768.prop.
[2024-05-20 18:14:16] [INFO ] Computed 121 invariants in 143 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 187/187 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 260/447 variables, 21/208 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 260/468 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 33/480 variables, 6/474 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 33/507 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 749/1229 variables, 90/597 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1229 variables, 749/1346 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :8 after 14
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :14 after 47
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :47 after 194
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :194 after 321
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :321 after 964
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :964 after 14485
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :14485 after 399017
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :399017 after 1.00084e+07
At refinement iteration 10 (INCLUDED_ONLY) 0/1229 variables, 0/1346 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 13/1242 variables, 4/1350 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1242 variables, 13/1363 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :1.00084e+07 after 6.03131e+09
At refinement iteration 13 (INCLUDED_ONLY) 0/1242 variables, 0/1363 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 1621/2863 variables, 1242/2605 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2863/2863 variables, and 2605 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5063 ms.
Refiners :[Domain max(s): 1242/1242 constraints, Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 94/94 constraints, State Equation: 1242/1242 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 187/187 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 260/447 variables, 21/208 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 260/468 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 8192
[2024-05-20 18:14:21] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 16 ms to minimize.
SDD size :6.03131e+09 after 7.20811e+13
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 33/480 variables, 6/475 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 33/508 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem ASLink-PT-02b-ReachabilityFireability-2024-09 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 749/1229 variables, 90/598 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1229 variables, 749/1347 constraints. Problems are: Problem set: 1 solved, 9 unsolved
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :7.20811e+13 after 7.24711e+13
[2024-05-20 18:14:23] [INFO ] Deduced a trap composed of 85 places in 438 ms of which 8 ms to minimize.
[2024-05-20 18:14:24] [INFO ] Deduced a trap composed of 72 places in 423 ms of which 6 ms to minimize.
[2024-05-20 18:14:25] [INFO ] Deduced a trap composed of 23 places in 853 ms of which 13 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :7.24711e+13 after 7.27837e+13
[2024-05-20 18:14:26] [INFO ] Deduced a trap composed of 61 places in 1067 ms of which 11 ms to minimize.
[2024-05-20 18:14:26] [INFO ] Deduced a trap composed of 169 places in 726 ms of which 10 ms to minimize.
SMT process timed out in 11046ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 154 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 214 transitions
Trivial Post-agglo rules discarded 214 transitions
Performed 214 trivial Post agglomeration. Transition count delta: 214
Iterating post reduction 0 with 214 rules applied. Total rules applied 214 place count 1242 transition count 1407
Reduce places removed 214 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 221 rules applied. Total rules applied 435 place count 1028 transition count 1400
Reduce places removed 1 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 2 with 18 rules applied. Total rules applied 453 place count 1027 transition count 1383
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 471 place count 1010 transition count 1382
Performed 232 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 232 Pre rules applied. Total rules applied 471 place count 1010 transition count 1150
Deduced a syphon composed of 232 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 4 with 481 rules applied. Total rules applied 952 place count 761 transition count 1150
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 4 with 18 rules applied. Total rules applied 970 place count 756 transition count 1137
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 15 rules applied. Total rules applied 985 place count 743 transition count 1135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 987 place count 741 transition count 1135
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 987 place count 741 transition count 1129
Deduced a syphon composed of 6 places in 7 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 15 rules applied. Total rules applied 1002 place count 732 transition count 1129
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 1002 place count 732 transition count 1126
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1008 place count 729 transition count 1126
Discarding 33 places :
Symmetric choice reduction at 7 with 33 rule applications. Total rules 1041 place count 696 transition count 1093
Iterating global reduction 7 with 33 rules applied. Total rules applied 1074 place count 696 transition count 1093
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1075 place count 696 transition count 1092
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 10 Pre rules applied. Total rules applied 1075 place count 696 transition count 1082
Deduced a syphon composed of 10 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 21 rules applied. Total rules applied 1096 place count 685 transition count 1082
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1096 place count 685 transition count 1081
Deduced a syphon composed of 1 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1099 place count 683 transition count 1081
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1102 place count 680 transition count 1060
Iterating global reduction 8 with 3 rules applied. Total rules applied 1105 place count 680 transition count 1060
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 1105 place count 680 transition count 1058
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1109 place count 678 transition count 1058
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 8 with 129 rules applied. Total rules applied 1238 place count 613 transition count 994
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1240 place count 612 transition count 1003
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1241 place count 612 transition count 1002
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1243 place count 612 transition count 1000
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1245 place count 610 transition count 1000
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1246 place count 610 transition count 999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1247 place count 609 transition count 999
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1248 place count 609 transition count 999
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1249 place count 608 transition count 998
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1251 place count 606 transition count 998
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 1251 place count 606 transition count 995
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 1257 place count 603 transition count 995
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 11 with 1 rules applied. Total rules applied 1258 place count 602 transition count 995
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 1262 place count 600 transition count 993
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1263 place count 600 transition count 992
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1264 place count 599 transition count 992
Applied a total of 1264 rules in 994 ms. Remains 599 /1242 variables (removed 643) and now considering 992/1621 (removed 629) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1011 ms. Remains : 599/1242 places, 992/1621 transitions.
RANDOM walk for 40000 steps (310 resets) in 444 ms. (89 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (113 resets) in 185 ms. (215 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (107 resets) in 202 ms. (197 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (109 resets) in 462 ms. (86 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (100 resets) in 270 ms. (147 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (105 resets) in 172 ms. (231 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (101 resets) in 172 ms. (231 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (113 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (84 resets) in 154 ms. (258 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (98 resets) in 268 ms. (148 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 201778 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 9
Probabilistic random walk after 201778 steps, saw 53815 distinct states, run finished after 3007 ms. (steps per millisecond=67 ) properties seen :0
// Phase 1: matrix 992 rows 599 cols
[2024-05-20 18:14:31] [INFO ] Computed 90 invariants in 57 ms
[2024-05-20 18:14:31] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 174/328 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/328 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2/330 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 266/596 variables, 68/87 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/596 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 2/598 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/599 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/599 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 992/1591 variables, 599/689 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1591 variables, 1/690 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,10 properties remain. new max is 65536
At refinement iteration 13 (INCLUDED_ONLY) 0/1591 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD size :7.27837e+13 after 8.14381e+13
At refinement iteration 14 (OVERLAPS) 0/1591 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1591/1591 variables, and 690 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2652 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 599/599 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 174/328 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-20 18:14:34] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/328 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/328 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/330 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 266/596 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-20 18:14:35] [INFO ] Deduced a trap composed of 86 places in 348 ms of which 5 ms to minimize.
[2024-05-20 18:14:36] [INFO ] Deduced a trap composed of 84 places in 330 ms of which 5 ms to minimize.
[2024-05-20 18:14:36] [INFO ] Deduced a trap composed of 83 places in 306 ms of which 4 ms to minimize.
[2024-05-20 18:14:36] [INFO ] Deduced a trap composed of 81 places in 183 ms of which 3 ms to minimize.
[2024-05-20 18:14:37] [INFO ] Deduced a trap composed of 108 places in 378 ms of which 5 ms to minimize.
[2024-05-20 18:14:37] [INFO ] Deduced a trap composed of 96 places in 400 ms of which 5 ms to minimize.
[2024-05-20 18:14:37] [INFO ] Deduced a trap composed of 91 places in 313 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/596 variables, 7/95 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-20 18:14:38] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/596 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-20 18:14:38] [INFO ] Deduced a trap composed of 50 places in 293 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/596 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-20 18:14:38] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/596 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/596 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 2/598 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/598 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 1/599 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/599 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem ASLink-PT-02b-ReachabilityFireability-2023-01 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2023-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2024-02 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2023-03 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2023-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2023-06 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2023-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2024-07 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2023-11 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2023-11 FALSE TECHNIQUES SMT_REFINEMENT
SDD proceeding with computation,10 properties remain. new max is 131072
SDD size :8.14381e+13 after 9.19489e+13
Problem ASLink-PT-02b-ReachabilityFireability-2024-15 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 16 (OVERLAPS) 992/1591 variables, 599/700 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1591 variables, 1/701 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1591 variables, 2/703 constraints. Problems are: Problem set: 7 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1591/1591 variables, and 703 constraints, problems are : Problem set: 7 solved, 2 unsolved in 32504 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 599/599 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/9 constraints, Known Traps: 11/11 constraints]
After SMT, in 35405ms problems are : Problem set: 7 solved, 2 unsolved
Parikh walk visited 0 properties in 5778 ms.
Support contains 50 out of 599 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 599/599 places, 992/992 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 599 transition count 977
Reduce places removed 16 places and 0 transitions.
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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 36 place count 582 transition count 973
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 39 place count 579 transition count 973
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 39 place count 579 transition count 915
Deduced a syphon composed of 58 places in 4 ms
Ensure Unique test removed 4 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 159 place count 517 transition count 915
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 161 place count 515 transition count 915
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 163 place count 513 transition count 913
Iterating global reduction 4 with 2 rules applied. Total rules applied 165 place count 513 transition count 913
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 166 place count 512 transition count 912
Iterating global reduction 4 with 1 rules applied. Total rules applied 167 place count 512 transition count 912
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 187 place count 502 transition count 902
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 189 place count 502 transition count 900
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 191 place count 500 transition count 900
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 192 place count 500 transition count 899
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 193 place count 499 transition count 899
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 195 place count 497 transition count 897
Applied a total of 195 rules in 220 ms. Remains 497 /599 variables (removed 102) and now considering 897/992 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 497/599 places, 897/992 transitions.
RANDOM walk for 40000 steps (530 resets) in 225 ms. (176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (175 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (134 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 282666 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 2
Probabilistic random walk after 282666 steps, saw 74072 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
// Phase 1: matrix 897 rows 497 cols
[2024-05-20 18:15:16] [INFO ] Computed 81 invariants in 47 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 151/201 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/207 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 264/471 variables, 55/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/476 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 21/497 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 897/1394 variables, 497/578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1394 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1394 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1394/1394 variables, and 578 constraints, problems are : Problem set: 0 solved, 2 unsolved in 749 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 151/201 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/207 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 264/471 variables, 55/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/476 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 21/497 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 897/1394 variables, 497/578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1394 variables, 2/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1394 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1394 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1394/1394 variables, and 580 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1940 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2774ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2228 ms.
Support contains 50 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 897/897 transitions.
SDD proceeding with computation,10 properties remain. new max is 262144
Applied a total of 0 rules in 33 ms. Remains 497 /497 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 497/497 places, 897/897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 897/897 transitions.
Applied a total of 0 rules in 19 ms. Remains 497 /497 variables (removed 0) and now considering 897/897 (removed 0) transitions.
[2024-05-20 18:15:21] [INFO ] Invariant cache hit.
SDD size :9.19489e+13 after 1.30594e+14
[2024-05-20 18:15:22] [INFO ] Implicit Places using invariants in 535 ms returned [3, 22, 43, 61, 79, 158, 162, 163, 174, 175, 177, 196, 215, 257, 296, 300, 301, 304, 316, 317, 318, 354, 356, 361, 381, 386, 387, 400, 406, 412, 418, 424, 430, 437, 443, 449, 455]
[2024-05-20 18:15:22] [INFO ] Actually due to overlaps returned [354, 318, 43, 61, 196, 361, 177, 174, 316, 175, 317, 356, 381, 3, 300, 301, 22, 79, 215, 386, 430, 449, 162, 163, 304, 387, 400, 406, 412, 418, 424, 437, 443, 455]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 549 ms to find 34 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 463/497 places, 897/897 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 460 transition count 863
Reduce places removed 34 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 58 rules applied. Total rules applied 95 place count 426 transition count 839
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 120 place count 402 transition count 838
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 120 place count 402 transition count 829
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 138 place count 393 transition count 829
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 147 place count 384 transition count 820
Iterating global reduction 3 with 9 rules applied. Total rules applied 156 place count 384 transition count 820
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 158 place count 382 transition count 816
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 382 transition count 816
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 3 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 212 place count 356 transition count 790
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 214 place count 354 transition count 788
Iterating global reduction 3 with 2 rules applied. Total rules applied 216 place count 354 transition count 788
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 218 place count 354 transition count 786
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 220 place count 353 transition count 787
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 233 place count 353 transition count 774
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 247 place count 339 transition count 774
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 248 place count 339 transition count 773
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 250 place count 339 transition count 773
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 252 place count 339 transition count 773
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 253 place count 338 transition count 772
Iterating global reduction 5 with 1 rules applied. Total rules applied 254 place count 338 transition count 772
Applied a total of 254 rules in 182 ms. Remains 338 /463 variables (removed 125) and now considering 772/897 (removed 125) transitions.
// Phase 1: matrix 772 rows 338 cols
[2024-05-20 18:15:22] [INFO ] Computed 43 invariants in 18 ms
[2024-05-20 18:15:22] [INFO ] Implicit Places using invariants in 320 ms returned [87, 110, 116, 119, 121, 127, 128, 187, 208, 224, 325, 328, 331, 334, 337]
[2024-05-20 18:15:22] [INFO ] Actually due to overlaps returned [127, 128, 116, 121, 87, 110, 187, 208, 224, 325, 328, 331, 334, 337]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 322 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 324/497 places, 772/897 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 324 transition count 771
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 323 transition count 771
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 317 transition count 765
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 317 transition count 765
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 313 transition count 761
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 313 transition count 761
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 place count 313 transition count 758
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 33 place count 309 transition count 754
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 38 place count 309 transition count 749
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 43 place count 304 transition count 749
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 304 transition count 748
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 45 place count 303 transition count 748
Applied a total of 45 rules in 90 ms. Remains 303 /324 variables (removed 21) and now considering 748/772 (removed 24) transitions.
// Phase 1: matrix 748 rows 303 cols
[2024-05-20 18:15:22] [INFO ] Computed 29 invariants in 17 ms
[2024-05-20 18:15:22] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-20 18:15:22] [INFO ] Invariant cache hit.
[2024-05-20 18:15:23] [INFO ] Implicit Places using invariants and state equation in 828 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 303/497 places, 748/897 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2269 ms. Remains : 303/497 places, 748/897 transitions.
RANDOM walk for 40000 steps (751 resets) in 216 ms. (184 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (258 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (186 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 236121 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 2
Probabilistic random walk after 236121 steps, saw 121114 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2024-05-20 18:15:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 122/172 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 130/302 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/303 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 748/1051 variables, 303/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 18:15:27] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1051 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1051 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1051 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1051/1051 variables, and 333 constraints, problems are : Problem set: 0 solved, 2 unsolved in 774 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 303/303 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 122/172 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 18:15:27] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 130/302 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/303 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 748/1051 variables, 303/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1051 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1051 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1051 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1051/1051 variables, and 336 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8007 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 303/303 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 8815ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 664 ms.
Support contains 50 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 748/748 transitions.
Applied a total of 0 rules in 32 ms. Remains 303 /303 variables (removed 0) and now considering 748/748 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 303/303 places, 748/748 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 748/748 transitions.
Applied a total of 0 rules in 16 ms. Remains 303 /303 variables (removed 0) and now considering 748/748 (removed 0) transitions.
[2024-05-20 18:15:36] [INFO ] Invariant cache hit.
[2024-05-20 18:15:36] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-20 18:15:36] [INFO ] Invariant cache hit.
[2024-05-20 18:15:37] [INFO ] Implicit Places using invariants and state equation in 711 ms returned []
Implicit Place search using SMT with State Equation took 976 ms to find 0 implicit places.
[2024-05-20 18:15:37] [INFO ] Redundant transitions in 48 ms returned []
Running 730 sub problems to find dead transitions.
[2024-05-20 18:15:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 3 (OVERLAPS) 1/302 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 730 unsolved
[2024-05-20 18:15:55] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 3 ms to minimize.
[2024-05-20 18:15:58] [INFO ] Deduced a trap composed of 69 places in 214 ms of which 3 ms to minimize.
[2024-05-20 18:15:58] [INFO ] Deduced a trap composed of 85 places in 196 ms of which 7 ms to minimize.
[2024-05-20 18:15:58] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 2 ms to minimize.
[2024-05-20 18:15:59] [INFO ] Deduced a trap composed of 92 places in 184 ms of which 3 ms to minimize.
[2024-05-20 18:16:00] [INFO ] Deduced a trap composed of 53 places in 181 ms of which 1 ms to minimize.
[2024-05-20 18:16:00] [INFO ] Deduced a trap composed of 81 places in 186 ms of which 3 ms to minimize.
[2024-05-20 18:16:02] [INFO ] Deduced a trap composed of 103 places in 235 ms of which 4 ms to minimize.
[2024-05-20 18:16:04] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 730 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/1051 variables, and 36 constraints, problems are : Problem set: 0 solved, 730 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/20 constraints, State Equation: 0/303 constraints, PredecessorRefiner: 730/730 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 730 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/301 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 3 (OVERLAPS) 1/302 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 730 unsolved
[2024-05-20 18:16:16] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 3 ms to minimize.
[2024-05-20 18:16:20] [INFO ] Deduced a trap composed of 62 places in 177 ms of which 3 ms to minimize.
[2024-05-20 18:16:20] [INFO ] Deduced a trap composed of 63 places in 210 ms of which 2 ms to minimize.
[2024-05-20 18:16:21] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 3 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 524288
SDD size :1.30594e+14 after 4.26315e+14
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 730 unsolved
[2024-05-20 18:16:31] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 3 ms to minimize.
[2024-05-20 18:16:31] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 730 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/1051 variables, and 42 constraints, problems are : Problem set: 0 solved, 730 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/20 constraints, State Equation: 0/303 constraints, PredecessorRefiner: 0/730 constraints, Known Traps: 15/15 constraints]
After SMT, in 60734ms problems are : Problem set: 0 solved, 730 unsolved
Search for dead transitions found 0 dead transitions in 60752ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61814 ms. Remains : 303/303 places, 748/748 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 303 transition count 747
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 302 transition count 747
Applied a total of 2 rules in 28 ms. Remains 302 /303 variables (removed 1) and now considering 747/748 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 747 rows 302 cols
[2024-05-20 18:16:38] [INFO ] Computed 29 invariants in 7 ms
[2024-05-20 18:16:38] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 18:16:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-05-20 18:16:38] [INFO ] [Nat]Absence check using 9 positive and 20 generalized place invariants in 15 ms returned sat
[2024-05-20 18:16:42] [INFO ] After 3877ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-20 18:16:44] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
[2024-05-20 18:16:44] [INFO ] Deduced a trap composed of 20 places in 210 ms of which 3 ms to minimize.
[2024-05-20 18:16:44] [INFO ] Deduced a trap composed of 45 places in 208 ms of which 3 ms to minimize.
[2024-05-20 18:16:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 652 ms
TRAPS : Iteration 1
[2024-05-20 18:16:48] [INFO ] Deduced a trap composed of 47 places in 213 ms of which 3 ms to minimize.
[2024-05-20 18:16:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
TRAPS : Iteration 2
[2024-05-20 18:16:48] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 3 ms to minimize.
[2024-05-20 18:16:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
TRAPS : Iteration 3
[2024-05-20 18:16:56] [INFO ] After 17649ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-20 18:16:57] [INFO ] After 18837ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-20 18:16:57] [INFO ] Flatten gal took : 115 ms
[2024-05-20 18:16:57] [INFO ] Flatten gal took : 77 ms
[2024-05-20 18:16:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17506847272732422373.gal : 21 ms
[2024-05-20 18:16:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2237095555913951635.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/ReachabilityCardinality17506847272732422373.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2237095555913951635.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/ReachabilityCardinality2237095555913951635.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 6
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :6 after 21
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :21 after 105
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :105 after 1281
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1281 after 2142
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2142 after 2391
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2391 after 10649
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :10649 after 38101
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :38101 after 338271
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :338271 after 1.29803e+06
Detected timeout of ITS tools.
[2024-05-20 18:17:12] [INFO ] Flatten gal took : 56 ms
[2024-05-20 18:17:12] [INFO ] Applying decomposition
[2024-05-20 18:17:12] [INFO ] Flatten gal took : 44 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/graph3781146489448488786.txt' '-o' '/tmp/graph3781146489448488786.bin' '-w' '/tmp/graph3781146489448488786.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3781146489448488786.bin' '-l' '-1' '-v' '-w' '/tmp/graph3781146489448488786.weights' '-q' '0' '-e' '0.001'
[2024-05-20 18:17:13] [INFO ] Decomposing Gal with order
[2024-05-20 18:17:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 18:17:13] [INFO ] Removed a total of 1496 redundant transitions.
[2024-05-20 18:17:13] [INFO ] Flatten gal took : 202 ms
[2024-05-20 18:17:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 63 ms.
[2024-05-20 18:17:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12034141092038634690.gal : 24 ms
[2024-05-20 18:17:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5124594418165933378.prop : 2 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/ReachabilityCardinality12034141092038634690.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5124594418165933378.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/ReachabilityCardinality5124594418165933378.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 21
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :21 after 63
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :63 after 4581
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :4581 after 243263
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :243263 after 587905
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.4796e+06 after 3.51697e+06
Reachability property ASLink-PT-02b-ReachabilityFireability-2024-13 is true.
Reachability property ASLink-PT-02b-ReachabilityFireability-2024-05 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 50516 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-20 18:17:29] [INFO ] Flatten gal took : 61 ms
[2024-05-20 18:17:29] [INFO ] Applying decomposition
[2024-05-20 18:17:29] [INFO ] Flatten gal took : 59 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/graph7120510864706404692.txt' '-o' '/tmp/graph7120510864706404692.bin' '-w' '/tmp/graph7120510864706404692.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7120510864706404692.bin' '-l' '-1' '-v' '-w' '/tmp/graph7120510864706404692.weights' '-q' '0' '-e' '0.001'
[2024-05-20 18:17:29] [INFO ] Decomposing Gal with order
[2024-05-20 18:17:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 18:17:29] [INFO ] Removed a total of 1310 redundant transitions.
[2024-05-20 18:17:29] [INFO ] Flatten gal took : 130 ms
[2024-05-20 18:17:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 40 ms.
[2024-05-20 18:17:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7683182026212043519.gal : 23 ms
[2024-05-20 18:17:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality615397417069609862.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/ReachabilityCardinality7683182026212043519.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality615397417069609862.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 ...306
Loading property file /tmp/ReachabilityCardinality615397417069609862.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :8 after 2.61053e+09
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.61053e+09 after 5.27653e+10
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5.27653e+10 after 6.96786e+15
Detected timeout of ITS tools.
[2024-05-20 18:47:30] [INFO ] Flatten gal took : 52 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17154055564597146667
[2024-05-20 18:47:31] [INFO ] Applying decomposition
[2024-05-20 18:47:31] [INFO ] Computing symmetric may disable matrix : 748 transitions.
[2024-05-20 18:47:31] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 18:47:31] [INFO ] Computing symmetric may enable matrix : 748 transitions.
[2024-05-20 18:47:31] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 18:47:31] [INFO ] Flatten gal took : 48 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/graph3218876418978454168.txt' '-o' '/tmp/graph3218876418978454168.bin' '-w' '/tmp/graph3218876418978454168.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3218876418978454168.bin' '-l' '-1' '-v' '-w' '/tmp/graph3218876418978454168.weights' '-q' '0' '-e' '0.001'
[2024-05-20 18:47:31] [INFO ] Decomposing Gal with order
[2024-05-20 18:47:31] [INFO ] Computing Do-Not-Accords matrix : 748 transitions.
[2024-05-20 18:47:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 18:47:31] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 18:47:31] [INFO ] Built C files in 292ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17154055564597146667
Running compilation step : cd /tmp/ltsmin17154055564597146667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-20 18:47:31] [INFO ] Removed a total of 1410 redundant transitions.
[2024-05-20 18:47:31] [INFO ] Flatten gal took : 85 ms
[2024-05-20 18:47:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 24 ms.
[2024-05-20 18:47:31] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5401830345991523584.gal : 14 ms
[2024-05-20 18:47:31] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9919407934233659820.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability5401830345991523584.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9919407934233659820.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 ...307
Loading property file /tmp/ReachabilityFireability9919407934233659820.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 63
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :63 after 231
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :231 after 6843
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :6843 after 53792
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :53792 after 57200
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :57200 after 60224
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :60224 after 65684
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :65684 after 74924
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :74924 after 88280
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :88280 after 346628
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :346628 after 533144
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.96486e+06 after 6.59213e+06
Compilation finished in 4139 ms.
Running link step : cd /tmp/ltsmin17154055564597146667;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin17154055564597146667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT02bReachabilityFireability202405==true'
Reachability property ASLink-PT-02b-ReachabilityFireability-2024-05 is true.
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.32218e+07 after 3.25057e+07
LTSmin run took 122791 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin17154055564597146667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT02bReachabilityFireability202413==true'
Reachability property ASLink-PT-02b-ReachabilityFireability-2024-13 is true.
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.1853e+09,200.978,2629272,14412,5264,1.41033e+06,2.918e+06,1184,7.32073e+06,374,2.93714e+07,0
Total reachable state count : 2185295316

Verifying 2 reachability properties.
Reachability property ASLink-PT-02b-ReachabilityFireability-2024-05 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-02b-ReachabilityFireability-2024-05,204,201.099,2629272,166,69,1.41033e+06,2.918e+06,1328,7.32073e+06,396,2.93714e+07,0
Reachability property ASLink-PT-02b-ReachabilityFireability-2024-13 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-02b-ReachabilityFireability-2024-13,32,206.657,2629272,122,127,1.41033e+06,2.918e+06,1440,7.32073e+06,410,2.93714e+07,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2457733 ms.

BK_STOP 1716231310739

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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 ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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