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.r224-tall-171649613100574.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 Medical-PT-16, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-171649613100574
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 14:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 13 14:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M 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 Medical-PT-16-ReachabilityCardinality-2024-00
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-2024-01
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-2024-02
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-2024-03
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-2024-04
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-2024-05
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-2023-06
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-2024-07
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-2024-08
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-2024-09
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-2024-10
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-2024-11
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-2024-12
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-2024-13
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-2023-14
FORMULA_NAME Medical-PT-16-ReachabilityCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716614031166

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-25 05:13:52] [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-25 05:13:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 05:13:52] [INFO ] Load time of PNML (sax parser for PT used): 297 ms
[2024-05-25 05:13:52] [INFO ] Transformed 312 places.
[2024-05-25 05:13:52] [INFO ] Transformed 5431 transitions.
[2024-05-25 05:13:52] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 441 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 242 places in 22 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-16-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40014 steps (164 resets) in 1089 ms. (36 steps per ms) remains 4/4 properties
[2024-05-25 05:13:53] [INFO ] Flatten gal took : 144 ms
BEST_FIRST walk for 40004 steps (39 resets) in 379 ms. (105 steps per ms) remains 4/4 properties
[2024-05-25 05:13:53] [INFO ] Flatten gal took : 54 ms
BEST_FIRST walk for 40002 steps (29 resets) in 209 ms. (190 steps per ms) remains 3/4 properties
FORMULA Medical-PT-16-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-25 05:13:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1667198632352081980.gal : 40 ms
BEST_FIRST walk for 40004 steps (23 resets) in 257 ms. (155 steps per ms) remains 3/3 properties
[2024-05-25 05:13:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14454870604163408161.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/ReachabilityCardinality1667198632352081980.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14454870604163408161.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (9 resets) in 242 ms. (164 steps per ms) remains 3/3 properties
[2024-05-25 05:13:53] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 69 cols
[2024-05-25 05:13:53] [INFO ] Computed 10 invariants in 5 ms

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/ReachabilityCardinality14454870604163408161.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 35
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :35 after 120
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :120 after 560
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :560 after 11628
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :11628 after 480165
[2024-05-25 05:13:53] [INFO ] State equation strengthened by 56 read => feed constraints.
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :480165 after 1.4763e+06
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 21/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 111/139 variables, 28/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 30/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 98/237 variables, 27/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 26/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/241 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 10/251 variables, 10/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/251 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 135 constraints, problems are : Problem set: 0 solved, 3 unsolved in 970 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 69/69 constraints, ReadFeed: 56/56 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 21/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-25 05:13:54] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 6 ms to minimize.
[2024-05-25 05:13:54] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-25 05:13:54] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 111/139 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 30/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 98/237 variables, 27/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 26/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-25 05:13:54] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 4/241 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/241 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/241 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 10/251 variables, 10/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/251 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/251 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-25 05:13:55] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/251 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.4763e+06 after 3.46468e+06
[2024-05-25 05:13:55] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/251 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/251 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/251 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 144 constraints, problems are : Problem set: 0 solved, 3 unsolved in 578 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 69/69 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 1623ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 279 ms.
Support contains 7 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 227/227 transitions.
Graph (complete) has 347 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 67 transition count 225
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 65 transition count 225
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 64 transition count 225
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 64 transition count 223
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 11 place count 62 transition count 223
Applied a total of 11 rules in 44 ms. Remains 62 /69 variables (removed 7) and now considering 223/227 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 62/69 places, 223/227 transitions.
RANDOM walk for 40026 steps (8 resets) in 520 ms. (76 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 230 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 292615 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 3
Probabilistic random walk after 292615 steps, saw 175343 distinct states, run finished after 3010 ms. (steps per millisecond=97 ) properties seen :0
[2024-05-25 05:13:58] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
// Phase 1: matrix 177 rows 62 cols
[2024-05-25 05:13:58] [INFO ] Computed 8 invariants in 5 ms
[2024-05-25 05:13:58] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 14/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 100/121 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 22/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 106/227 variables, 30/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 34/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/228 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 11/239 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/239 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/239 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 127 constraints, problems are : Problem set: 0 solved, 3 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 57/57 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 14/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-25 05:13:59] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 100/121 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 22/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 106/227 variables, 30/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 34/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/228 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 11/239 variables, 10/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/239 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/239 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/239 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-25 05:13:59] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-25 05:13:59] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/239 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/239 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/239 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 133 constraints, problems are : Problem set: 0 solved, 3 unsolved in 518 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 1056ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 362 ms.
Support contains 7 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 223/223 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 62/62 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 223/223 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-25 05:14:00] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
[2024-05-25 05:14:00] [INFO ] Invariant cache hit.
[2024-05-25 05:14:00] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-25 05:14:00] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
[2024-05-25 05:14:00] [INFO ] Invariant cache hit.
[2024-05-25 05:14:00] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-25 05:14:00] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-05-25 05:14:00] [INFO ] Redundant transitions in 9 ms returned []
Running 221 sub problems to find dead transitions.
[2024-05-25 05:14:00] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
[2024-05-25 05:14:00] [INFO ] Invariant cache hit.
[2024-05-25 05:14:00] [INFO ] State equation strengthened by 57 read => feed constraints.
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :3.46468e+06 after 7.43758e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-25 05:14:01] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-25 05:14:02] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
Problem TDEAD135 is UNSAT
Problem TDEAD140 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 2/10 constraints. Problems are: Problem set: 2 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 177/238 variables, 61/71 constraints. Problems are: Problem set: 2 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 57/128 constraints. Problems are: Problem set: 2 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/128 constraints. Problems are: Problem set: 2 solved, 219 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/239 variables, 1/129 constraints. Problems are: Problem set: 2 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/129 constraints. Problems are: Problem set: 2 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/239 variables, 0/129 constraints. Problems are: Problem set: 2 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 129 constraints, problems are : Problem set: 2 solved, 219 unsolved in 6147 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 2/10 constraints. Problems are: Problem set: 2 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 177/238 variables, 61/71 constraints. Problems are: Problem set: 2 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 57/128 constraints. Problems are: Problem set: 2 solved, 219 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD145 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 169/297 constraints. Problems are: Problem set: 16 solved, 205 unsolved
[2024-05-25 05:14:08] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-25 05:14:09] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 2/299 constraints. Problems are: Problem set: 16 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/299 constraints. Problems are: Problem set: 16 solved, 205 unsolved
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
At refinement iteration 8 (OVERLAPS) 1/239 variables, 1/300 constraints. Problems are: Problem set: 37 solved, 184 unsolved
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD120 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 50/350 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2024-05-25 05:14:12] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 1/351 constraints. Problems are: Problem set: 43 solved, 178 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 0/351 constraints. Problems are: Problem set: 43 solved, 178 unsolved
At refinement iteration 12 (OVERLAPS) 0/239 variables, 0/351 constraints. Problems are: Problem set: 43 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 351 constraints, problems are : Problem set: 43 solved, 178 unsolved in 9161 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 219/221 constraints, Known Traps: 5/5 constraints]
After SMT, in 15584ms problems are : Problem set: 43 solved, 178 unsolved
Search for dead transitions found 43 dead transitions in 15590ms
Found 43 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 43 transitions
Dead transitions reduction (with SMT) removed 43 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/62 places, 180/223 transitions.
Reduce places removed 9 places and 65 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 53 transition count 115
Reduce places removed 7 places and 31 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 46 transition count 84
Reduce places removed 2 places and 11 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 44 transition count 73
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 42 transition count 61
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 21 place count 41 transition count 57
Deduced a syphon composed of 3 places in 1 ms
Applied a total of 21 rules in 10 ms. Remains 41 /62 variables (removed 21) and now considering 57/180 (removed 123) transitions.
[2024-05-25 05:14:16] [INFO ] Flow matrix only has 51 transitions (discarded 6 similar events)
// Phase 1: matrix 51 rows 41 cols
[2024-05-25 05:14:16] [INFO ] Computed 11 invariants in 1 ms
[2024-05-25 05:14:16] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-25 05:14:16] [INFO ] Flow matrix only has 51 transitions (discarded 6 similar events)
[2024-05-25 05:14:16] [INFO ] Invariant cache hit.
[2024-05-25 05:14:16] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-25 05:14:16] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 41/62 places, 57/223 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 16041 ms. Remains : 41/62 places, 57/223 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
FORMULA Medical-PT-16-ReachabilityCardinality-2023-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-16-ReachabilityCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40009 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2272122 steps, run timeout after 3001 ms. (steps per millisecond=757 ) properties seen :0 out of 1
Probabilistic random walk after 2272122 steps, saw 1363047 distinct states, run finished after 3001 ms. (steps per millisecond=757 ) properties seen :0
[2024-05-25 05:14:19] [INFO ] Flow matrix only has 51 transitions (discarded 6 similar events)
// Phase 1: matrix 51 rows 38 cols
[2024-05-25 05:14:19] [INFO ] Computed 8 invariants in 10 ms
[2024-05-25 05:14:19] [INFO ] State equation strengthened by 27 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/27 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/52 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 13/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/67 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/67 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/67 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/77 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/77 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/77 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/77 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/86 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/86 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/86 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/86 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/87 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/87 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/87 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/89 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/89 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/89 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/89 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/27 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/52 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 13/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/67 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/67 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/67 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/67 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/77 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/77 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/77 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 05:14:19] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/77 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/77 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 9/86 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/86 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/86 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/86 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/87 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/87 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/89 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/89 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/89 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/89 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 75 constraints, problems are : Problem set: 0 solved, 1 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 212ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 57/57 transitions.
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 38 transition count 56
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 37 transition count 56
Applied a total of 2 rules in 3 ms. Remains 37 /38 variables (removed 1) and now considering 56/57 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 37/38 places, 56/57 transitions.
RANDOM walk for 40016 steps (8 resets) in 34 ms. (1143 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2485790 steps, run timeout after 3001 ms. (steps per millisecond=828 ) properties seen :0 out of 1
Probabilistic random walk after 2485790 steps, saw 1452809 distinct states, run finished after 3001 ms. (steps per millisecond=828 ) properties seen :0
[2024-05-25 05:14:22] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
// Phase 1: matrix 50 rows 37 cols
[2024-05-25 05:14:22] [INFO ] Computed 8 invariants in 2 ms
[2024-05-25 05:14:22] [INFO ] State equation strengthened by 27 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/27 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/52 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/68 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/68 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/82 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/82 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/82 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/82 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/83 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/83 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/83 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/87 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/87 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/87 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 875 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/27 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/52 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/68 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/68 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/68 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/82 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/82 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/82 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 05:14:24] [INFO ] Deduced a trap composed of 4 places in 434 ms of which 30 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/82 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/82 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/83 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/83 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/83 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/87 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/87 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/87 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/87 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/87 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 74 constraints, problems are : Problem set: 0 solved, 1 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1442ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 37/37 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-05-25 05:14:24] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-25 05:14:24] [INFO ] Invariant cache hit.
[2024-05-25 05:14:24] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-25 05:14:24] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-25 05:14:24] [INFO ] Invariant cache hit.
[2024-05-25 05:14:24] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-25 05:14:26] [INFO ] Implicit Places using invariants and state equation in 2424 ms returned []
Implicit Place search using SMT with State Equation took 2501 ms to find 0 implicit places.
[2024-05-25 05:14:26] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-25 05:14:26] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-25 05:14:26] [INFO ] Invariant cache hit.
[2024-05-25 05:14:26] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 50/87 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-25 05:14:27] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-25 05:14:27] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 30 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/87 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 55 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 74 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1154 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 50/87 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 27/74 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 55/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 129 constraints, problems are : Problem set: 0 solved, 55 unsolved in 609 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 2/2 constraints]
After SMT, in 1781ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1781ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4297 ms. Remains : 37/37 places, 56/56 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 87 edges and 37 vertex of which 35 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 35 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 33 transition count 44
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 22 place count 29 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 26 transition count 53
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 26 transition count 56
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 23 transition count 56
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 23 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 22 transition count 67
Applied a total of 34 rules in 13 ms. Remains 22 /37 variables (removed 15) and now considering 67/56 (removed -11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 67 rows 22 cols
[2024-05-25 05:14:28] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 05:14:28] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 05:14:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 05:14:28] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 05:14:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 05:14:28] [INFO ] After 3ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-25 05:14:28] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-25 05:14:28] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-25 05:14:28] [INFO ] Flatten gal took : 10 ms
[2024-05-25 05:14:28] [INFO ] Flatten gal took : 11 ms
[2024-05-25 05:14:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12934397031380382728.gal : 7 ms
[2024-05-25 05:14:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14008112776484647406.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/ReachabilityCardinality12934397031380382728.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14008112776484647406.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 ...330
Loading property file /tmp/ReachabilityCardinality14008112776484647406.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 19
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :19 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 71
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :71 after 137
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :137 after 267
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :267 after 525
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :525 after 1039
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1039 after 2065
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :7.43758e+06 after 1.53795e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2065 after 4115
Detected timeout of ITS tools.
[2024-05-25 05:14:43] [INFO ] Flatten gal took : 5 ms
[2024-05-25 05:14:43] [INFO ] Applying decomposition
[2024-05-25 05:14:43] [INFO ] Flatten gal took : 5 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/graph17677415937739161920.txt' '-o' '/tmp/graph17677415937739161920.bin' '-w' '/tmp/graph17677415937739161920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17677415937739161920.bin' '-l' '-1' '-v' '-w' '/tmp/graph17677415937739161920.weights' '-q' '0' '-e' '0.001'
[2024-05-25 05:14:44] [INFO ] Decomposing Gal with order
[2024-05-25 05:14:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 05:14:44] [INFO ] Removed a total of 65 redundant transitions.
[2024-05-25 05:14:44] [INFO ] Flatten gal took : 108 ms
[2024-05-25 05:14:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 8 ms.
[2024-05-25 05:14:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15717704441238296293.gal : 4 ms
[2024-05-25 05:14:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6071310646550494987.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/ReachabilityCardinality15717704441238296293.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6071310646550494987.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/ReachabilityCardinality6071310646550494987.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :520 after 1033
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1033 after 2058
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2058 after 4107
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30834 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-25 05:14:59] [INFO ] Flatten gal took : 22 ms
[2024-05-25 05:14:59] [INFO ] Applying decomposition
[2024-05-25 05:14:59] [INFO ] Flatten gal took : 15 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/graph14355903732327004527.txt' '-o' '/tmp/graph14355903732327004527.bin' '-w' '/tmp/graph14355903732327004527.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14355903732327004527.bin' '-l' '-1' '-v' '-w' '/tmp/graph14355903732327004527.weights' '-q' '0' '-e' '0.001'
[2024-05-25 05:14:59] [INFO ] Decomposing Gal with order
[2024-05-25 05:14:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 05:14:59] [INFO ] Removed a total of 90 redundant transitions.
[2024-05-25 05:14:59] [INFO ] Flatten gal took : 25 ms
[2024-05-25 05:14:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 2 ms.
[2024-05-25 05:14:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10320198897854733924.gal : 2 ms
[2024-05-25 05:14:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5744704434356970801.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/ReachabilityCardinality10320198897854733924.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5744704434356970801.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/ReachabilityCardinality5744704434356970801.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 72
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :72 after 240
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :240 after 3744
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3744 after 9690
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9690 after 9690
ITS-tools command line returned an error code 137
[2024-05-25 05:44:51] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8155758870267728981
[2024-05-25 05:44:51] [INFO ] Applying decomposition
[2024-05-25 05:44:51] [INFO ] Flatten gal took : 3 ms
[2024-05-25 05:44:51] [INFO ] Computing symmetric may disable matrix : 56 transitions.
[2024-05-25 05:44:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 05:44:51] [INFO ] Computing symmetric may enable matrix : 56 transitions.
[2024-05-25 05:44:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 05:44:51] [INFO ] Computing Do-Not-Accords matrix : 56 transitions.
[2024-05-25 05:44:51] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph16578851149409644488.txt' '-o' '/tmp/graph16578851149409644488.bin' '-w' '/tmp/graph16578851149409644488.weights'
[2024-05-25 05:44:51] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8155758870267728981
Running compilation step : cd /tmp/ltsmin8155758870267728981;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16578851149409644488.bin' '-l' '-1' '-v' '-w' '/tmp/graph16578851149409644488.weights' '-q' '0' '-e' '0.001'
[2024-05-25 05:44:51] [INFO ] Decomposing Gal with order
[2024-05-25 05:44:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 05:44:51] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-25 05:44:51] [INFO ] Flatten gal took : 5 ms
[2024-05-25 05:44:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 15 ms.
[2024-05-25 05:44:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15466546587267927506.gal : 0 ms
[2024-05-25 05:44:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6784250748201690550.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/ReachabilityCardinality15466546587267927506.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6784250748201690550.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/ReachabilityCardinality6784250748201690550.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 68
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :68 after 68
Compilation finished in 365 ms.
Running link step : cd /tmp/ltsmin8155758870267728981;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin8155758870267728981;'/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' 'MedicalPT16ReachabilityCardinality202314==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: Initializing POR dependencies: labels 57, guards 56
pins2lts-mc-linux64( 2/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.031: "MedicalPT16ReachabilityCardinality202314==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.032: "MedicalPT16ReachabilityCardinality202314==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.027: "MedicalPT16ReachabilityCardinality202314==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.032: There are 57 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.032: State length is 37, there are 56 groups
pins2lts-mc-linux64( 0/ 8), 0.032: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.032: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.032: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.032: Visible groups: 0 / 56, labels: 1 / 57
pins2lts-mc-linux64( 0/ 8), 0.032: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.032: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.028: "MedicalPT16ReachabilityCardinality202314==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.027: "MedicalPT16ReachabilityCardinality202314==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.030: "MedicalPT16ReachabilityCardinality202314==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.031: "MedicalPT16ReachabilityCardinality202314==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.032: "MedicalPT16ReachabilityCardinality202314==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.077: ~9 levels ~960 states ~3104 transitions
pins2lts-mc-linux64( 0/ 8), 0.093: ~11 levels ~1920 states ~6552 transitions
pins2lts-mc-linux64( 0/ 8), 0.133: ~13 levels ~3840 states ~13448 transitions
pins2lts-mc-linux64( 1/ 8), 0.182: ~5 levels ~7680 states ~29200 transitions
pins2lts-mc-linux64( 1/ 8), 0.242: ~6 levels ~15360 states ~60760 transitions
pins2lts-mc-linux64( 1/ 8), 0.408: ~8 levels ~30720 states ~124536 transitions
pins2lts-mc-linux64( 1/ 8), 0.704: ~11 levels ~61440 states ~257512 transitions
pins2lts-mc-linux64( 3/ 8), 1.287: ~16 levels ~122880 states ~519288 transitions
pins2lts-mc-linux64( 6/ 8), 2.211: ~15 levels ~245760 states ~1114032 transitions
pins2lts-mc-linux64( 6/ 8), 3.702: ~17 levels ~491520 states ~2269936 transitions
pins2lts-mc-linux64( 6/ 8), 6.882: ~20 levels ~983040 states ~4650944 transitions
pins2lts-mc-linux64( 4/ 8), 11.146: ~29 levels ~1966080 states ~9372168 transitions
pins2lts-mc-linux64( 6/ 8), 19.780: ~27 levels ~3932160 states ~19391816 transitions
pins2lts-mc-linux64( 6/ 8), 37.273: ~31 levels ~7864320 states ~39697352 transitions
pins2lts-mc-linux64( 0/ 8), 78.929: ~51 levels ~15728640 states ~81518016 transitions
pins2lts-mc-linux64( 6/ 8), 159.141: ~41 levels ~31457280 states ~165271552 transitions
pins2lts-mc-linux64( 6/ 8), 339.784: ~47 levels ~62914560 states ~336875512 transitions
pins2lts-mc-linux64( 6/ 8), 745.639: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 745.689:
pins2lts-mc-linux64( 0/ 8), 745.689: mean standard work distribution: 2.6% (states) 1.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 745.689:
pins2lts-mc-linux64( 0/ 8), 745.689: Explored 119938136 states 684417625 transitions, fanout: 5.706
pins2lts-mc-linux64( 0/ 8), 745.689: Total exploration time 745.660 sec (745.620 sec minimum, 745.634 sec on average)
pins2lts-mc-linux64( 0/ 8), 745.689: States per second: 160848, Transitions per second: 917868
pins2lts-mc-linux64( 0/ 8), 745.689: Ignoring proviso: 20506966
pins2lts-mc-linux64( 0/ 8), 745.689:
pins2lts-mc-linux64( 0/ 8), 745.689: Queue width: 8B, total height: 15241610, memory: 116.28MB
pins2lts-mc-linux64( 0/ 8), 745.689: Tree memory: 1118.8MB, 8.7 B/state, compr.: 5.8%
pins2lts-mc-linux64( 0/ 8), 745.689: Tree fill ratio (roots/leafs): 99.0%/37.0%
pins2lts-mc-linux64( 0/ 8), 745.689: Stored 56 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 745.689: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 745.689: Est. total memory use: 1235.1MB (~1140.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8155758870267728981;'/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' 'MedicalPT16ReachabilityCardinality202314==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8155758870267728981;'/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' 'MedicalPT16ReachabilityCardinality202314==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="Medical-PT-16"
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 Medical-PT-16, 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 r224-tall-171649613100574"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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