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.r356-tall-171683762301022.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 ShieldRVt-PT-040B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683762301022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 21:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 21:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 21:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 11 21:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 489K May 18 16:43 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 ShieldRVt-PT-040B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717085115223

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-30 16:05:16] [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-30 16:05:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 16:05:16] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2024-05-30 16:05:16] [INFO ] Transformed 2003 places.
[2024-05-30 16:05:16] [INFO ] Transformed 2003 transitions.
[2024-05-30 16:05:16] [INFO ] Found NUPN structural information;
[2024-05-30 16:05:16] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 305 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1974 ms. (20 steps per ms) remains 6/12 properties
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 223 ms. (178 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 404 ms. (98 steps per ms) remains 6/6 properties
[2024-05-30 16:05:17] [INFO ] Flatten gal took : 393 ms
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 6/6 properties
[2024-05-30 16:05:17] [INFO ] Flatten gal took : 211 ms
[2024-05-30 16:05:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4555678896599166390.gal : 89 ms
[2024-05-30 16:05:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11262510075468312642.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/ReachabilityCardinality4555678896599166390.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11262510075468312642.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
BEST_FIRST walk for 40003 steps (8 resets) in 2139 ms. (18 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
Loading property file /tmp/ReachabilityCardinality11262510075468312642.prop.
// Phase 1: matrix 2003 rows 2003 cols
[2024-05-30 16:05:18] [INFO ] Computed 161 invariants in 38 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 751/798 variables, 59/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/798 variables, 751/857 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/798 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1205/2003 variables, 102/959 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2003 variables, 1205/2164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2003 variables, 0/2164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2003/4006 variables, 2003/4167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4006 variables, 0/4167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :36 after 249
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :249 after 3.68688e+06
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :3.68688e+06 after 3.36584e+13
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :3.36584e+13 after 2.80525e+27
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :2.80525e+27 after 2.50537e+55
At refinement iteration 10 (OVERLAPS) 0/4006 variables, 0/4167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4006/4006 variables, and 4167 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1997 ms.
Refiners :[Domain max(s): 2003/2003 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 2003/2003 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Reachability property ShieldRVt-PT-040B-ReachabilityCardinality-2024-03 is true.
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 2 (OVERLAPS) 751/798 variables, 59/106 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/798 variables, 751/857 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-30 16:05:20] [INFO ] Deduced a trap composed of 56 places in 163 ms of which 25 ms to minimize.
[2024-05-30 16:05:20] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 3 ms to minimize.
[2024-05-30 16:05:21] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 3 ms to minimize.
[2024-05-30 16:05:21] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 3 ms to minimize.
[2024-05-30 16:05:21] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 3 ms to minimize.
[2024-05-30 16:05:21] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 2 ms to minimize.
[2024-05-30 16:05:21] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 2 ms to minimize.
[2024-05-30 16:05:21] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-05-30 16:05:21] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
[2024-05-30 16:05:21] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 2 ms to minimize.
[2024-05-30 16:05:21] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
[2024-05-30 16:05:22] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 2 ms to minimize.
[2024-05-30 16:05:22] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 2 ms to minimize.
[2024-05-30 16:05:22] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 2 ms to minimize.
[2024-05-30 16:05:22] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 2 ms to minimize.
[2024-05-30 16:05:22] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/798 variables, 16/873 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/798 variables, 0/873 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1205/2003 variables, 102/975 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2003 variables, 1205/2180 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-30 16:05:22] [INFO ] Deduced a trap composed of 23 places in 255 ms of which 5 ms to minimize.
[2024-05-30 16:05:23] [INFO ] Deduced a trap composed of 30 places in 255 ms of which 6 ms to minimize.
[2024-05-30 16:05:23] [INFO ] Deduced a trap composed of 43 places in 231 ms of which 4 ms to minimize.
[2024-05-30 16:05:23] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 4 ms to minimize.
[2024-05-30 16:05:23] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 4 ms to minimize.
[2024-05-30 16:05:24] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 4 ms to minimize.
[2024-05-30 16:05:24] [INFO ] Deduced a trap composed of 36 places in 184 ms of which 4 ms to minimize.
[2024-05-30 16:05:24] [INFO ] Deduced a trap composed of 50 places in 173 ms of which 4 ms to minimize.
[2024-05-30 16:05:24] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 3 ms to minimize.
[2024-05-30 16:05:25] [INFO ] Deduced a trap composed of 78 places in 176 ms of which 3 ms to minimize.
[2024-05-30 16:05:25] [INFO ] Deduced a trap composed of 50 places in 167 ms of which 4 ms to minimize.
[2024-05-30 16:05:25] [INFO ] Deduced a trap composed of 61 places in 150 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2003/4006 variables, and 2192 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5007 ms.
Refiners :[Domain max(s): 2003/2003 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/2003 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 28/28 constraints]
After SMT, in 7150ms problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 42 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 611 transitions
Trivial Post-agglo rules discarded 611 transitions
Performed 611 trivial Post agglomeration. Transition count delta: 611
Iterating post reduction 0 with 611 rules applied. Total rules applied 611 place count 2003 transition count 1392
Reduce places removed 611 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 613 rules applied. Total rules applied 1224 place count 1392 transition count 1390
Reduce places removed 1 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 11 rules applied. Total rules applied 1235 place count 1391 transition count 1380
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1245 place count 1381 transition count 1380
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 159 Pre rules applied. Total rules applied 1245 place count 1381 transition count 1221
Deduced a syphon composed of 159 places in 3 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 4 with 318 rules applied. Total rules applied 1563 place count 1222 transition count 1221
Discarding 264 places :
Symmetric choice reduction at 4 with 264 rule applications. Total rules 1827 place count 958 transition count 957
Iterating global reduction 4 with 264 rules applied. Total rules applied 2091 place count 958 transition count 957
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 105 Pre rules applied. Total rules applied 2091 place count 958 transition count 852
Deduced a syphon composed of 105 places in 3 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 4 with 210 rules applied. Total rules applied 2301 place count 853 transition count 852
Performed 361 Post agglomeration using F-continuation condition.Transition count delta: 361
Deduced a syphon composed of 361 places in 1 ms
Reduce places removed 361 places and 0 transitions.
Iterating global reduction 4 with 722 rules applied. Total rules applied 3023 place count 492 transition count 491
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -83
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3225 place count 391 transition count 574
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 3235 place count 386 transition count 578
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3236 place count 386 transition count 577
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3240 place count 386 transition count 573
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 3244 place count 382 transition count 573
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 3247 place count 382 transition count 570
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3248 place count 382 transition count 570
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3249 place count 381 transition count 569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3250 place count 380 transition count 569
Applied a total of 3250 rules in 461 ms. Remains 380 /2003 variables (removed 1623) and now considering 569/2003 (removed 1434) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 470 ms. Remains : 380/2003 places, 569/2003 transitions.
RANDOM walk for 40000 steps (8 resets) in 985 ms. (40 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 200 ms. (199 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 256 ms. (155 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 186801 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 5
Probabilistic random walk after 186801 steps, saw 121849 distinct states, run finished after 3013 ms. (steps per millisecond=61 ) properties seen :0
// Phase 1: matrix 569 rows 380 cols
[2024-05-30 16:05:29] [INFO ] Computed 160 invariants in 3 ms
[2024-05-30 16:05:29] [INFO ] State equation strengthened by 87 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 134/176 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 14/190 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 348/538 variables, 190/255 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 79/334 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 302/840 variables, 136/470 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/840 variables, 68/538 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/840 variables, 8/546 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/840 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 95/935 variables, 46/592 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/935 variables, 23/615 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/935 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 14/949 variables, 8/623 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/949 variables, 4/627 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/949 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/949 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 949/949 variables, and 627 constraints, problems are : Problem set: 0 solved, 5 unsolved in 630 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 380/380 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 134/176 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 14/190 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 348/538 variables, 190/255 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 79/334 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 16:05:30] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-30 16:05:30] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 302/840 variables, 136/473 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/840 variables, 68/541 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/840 variables, 8/549 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/840 variables, 4/553 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 16:05:30] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/840 variables, 1/554 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/840 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 95/935 variables, 46/600 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/935 variables, 23/623 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/935 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 14/949 variables, 8/631 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/949 variables, 4/635 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/949 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/949 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 949/949 variables, and 635 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1407 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 380/380 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 2058ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1496 ms.
Support contains 42 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 569/569 transitions.
Applied a total of 0 rules in 19 ms. Remains 380 /380 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 380/380 places, 569/569 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 569/569 transitions.
Applied a total of 0 rules in 10 ms. Remains 380 /380 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2024-05-30 16:05:33] [INFO ] Invariant cache hit.
[2024-05-30 16:05:33] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-30 16:05:33] [INFO ] Invariant cache hit.
[2024-05-30 16:05:33] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-30 16:05:33] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
[2024-05-30 16:05:33] [INFO ] Redundant transitions in 35 ms returned []
Running 559 sub problems to find dead transitions.
[2024-05-30 16:05:34] [INFO ] Invariant cache hit.
[2024-05-30 16:05:34] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/373 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 2 (OVERLAPS) 7/380 variables, 44/160 constraints. Problems are: Problem set: 0 solved, 559 unsolved
[2024-05-30 16:05:41] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-30 16:05:41] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-30 16:05:41] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 559 unsolved
[2024-05-30 16:05:48] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-30 16:05:49] [INFO ] Deduced a trap composed of 5 places in 808 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 6 (OVERLAPS) 569/949 variables, 380/545 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/949 variables, 87/632 constraints. Problems are: Problem set: 0 solved, 559 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 949/949 variables, and 632 constraints, problems are : Problem set: 0 solved, 559 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 380/380 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 559/559 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 559 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/373 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 3 (OVERLAPS) 7/380 variables, 44/162 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 6 (OVERLAPS) 569/949 variables, 380/545 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/949 variables, 87/632 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/949 variables, 559/1191 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 559 unsolved
[2024-05-30 16:06:29] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-30 16:06:30] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 1)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 1)
(s24 1)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 1)
(s45 1)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 1)
(s51 0)
(s52 1)
(s53 1)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 1)
(s70 1)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 1)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 1)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 1)
(s103 0)
(s104 1)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 1)
(s113 1)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 1)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 1)
(s126 0)
(s127 0)
(s128 1)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 1)
(s145 1)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 1)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 1)
(s166 1)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 1)
(s172 0)
(s173 1)
(s174 1)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 1)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 1)
(s191 0)
(s192 1)
(s193 0)
(s194 0)
(s195 1)
(s196 0)
(s197 1)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 1)
(s209 0)
(s210 0)
(s211 0)timeout

(s212 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 949/949 variables, and 1193 constraints, problems are : Problem set: 0 solved, 559 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 380/380 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 559/559 constraints, Known Traps: 7/7 constraints]
After SMT, in 60258ms problems are : Problem set: 0 solved, 559 unsolved
Search for dead transitions found 0 dead transitions in 60274ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61166 ms. Remains : 380/380 places, 569/569 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 120 edges and 380 vertex of which 4 / 380 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1234 edges and 378 vertex of which 376 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 117 edges and 374 vertex of which 2 / 374 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 373 transition count 560
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 116 edges and 372 vertex of which 2 / 372 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 371 transition count 555
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 115 edges and 370 vertex of which 2 / 370 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 20 place count 369 transition count 552
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 25 place count 368 transition count 548
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 25 place count 368 transition count 547
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 27 place count 367 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 30 place count 365 transition count 546
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 34 place count 365 transition count 542
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 51 place count 365 transition count 525
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 57 place count 365 transition count 525
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 63 place count 365 transition count 519
Applied a total of 63 rules in 85 ms. Remains 365 /380 variables (removed 15) and now considering 519/569 (removed 50) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 519 rows 365 cols
[2024-05-30 16:06:34] [INFO ] Computed 153 invariants in 1 ms
[2024-05-30 16:06:34] [INFO ] [Real]Absence check using 153 positive place invariants in 16 ms returned sat
[2024-05-30 16:06:34] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-30 16:06:34] [INFO ] [Nat]Absence check using 153 positive place invariants in 17 ms returned sat
[2024-05-30 16:06:34] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-30 16:06:34] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2024-05-30 16:06:34] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 16:06:34] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-30 16:06:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 173 ms
TRAPS : Iteration 1
[2024-05-30 16:06:35] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-30 16:06:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
TRAPS : Iteration 2
[2024-05-30 16:06:35] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-30 16:06:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
TRAPS : Iteration 3
[2024-05-30 16:06:35] [INFO ] After 1067ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-30 16:06:35] [INFO ] After 1294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2024-05-30 16:06:35] [INFO ] Flatten gal took : 52 ms
[2024-05-30 16:06:35] [INFO ] Flatten gal took : 41 ms
[2024-05-30 16:06:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2375676530384820017.gal : 16 ms
[2024-05-30 16:06:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6757256571848015425.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2375676530384820017.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6757256571848015425.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 ...328
Loading property file /tmp/ReachabilityCardinality6757256571848015425.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :6 after 14
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :14 after 28
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :28 after 3780
Reachability property ShieldRVt-PT-040B-ReachabilityCardinality-2024-01 is true.
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :37800 after 272860
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :272860 after 273666
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :273666 after 287659
Invariant property ShieldRVt-PT-040B-ReachabilityCardinality-2024-06 does not hold.
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :287659 after 1.19014e+07
Detected timeout of ITS tools.
[2024-05-30 16:06:50] [INFO ] Flatten gal took : 31 ms
[2024-05-30 16:06:50] [INFO ] Applying decomposition
[2024-05-30 16:06:51] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12905013174614808424.txt' '-o' '/tmp/graph12905013174614808424.bin' '-w' '/tmp/graph12905013174614808424.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12905013174614808424.bin' '-l' '-1' '-v' '-w' '/tmp/graph12905013174614808424.weights' '-q' '0' '-e' '0.001'
[2024-05-30 16:06:51] [INFO ] Decomposing Gal with order
[2024-05-30 16:06:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 16:06:51] [INFO ] Removed a total of 492 redundant transitions.
[2024-05-30 16:06:51] [INFO ] Flatten gal took : 104 ms
[2024-05-30 16:06:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 17 ms.
[2024-05-30 16:06:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17490737819026875239.gal : 15 ms
[2024-05-30 16:06:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12570183002768797492.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/ReachabilityCardinality17490737819026875239.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12570183002768797492.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality12570183002768797492.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 14
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :14 after 28
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :28 after 3780
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,5.54848e+53,0.533771,25788,532,35,40566,169,1073,121081,66,397,0
Total reachable state count : 5.548484334254164752971595448429385674669e+53

Verifying 3 reachability properties.
Reachability property ShieldRVt-PT-040B-ReachabilityCardinality-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
ShieldRVt-PT-040B-ReachabilityCardinality-2024-05,1.37798e+43,0.535035,26048,189,18,40566,169,1073,121081,68,397,0
Invariant property ShieldRVt-PT-040B-ReachabilityCardinality-2024-09 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityCardinality-2024-09,1.85305e+53,0.544295,26048,906,40,40566,169,1121,121081,73,397,1329
Invariant property ShieldRVt-PT-040B-ReachabilityCardinality-2024-15 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityCardinality-2024-15,7.39798e+52,0.545174,26048,409,30,40566,169,1123,121081,73,397,1405
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 17876 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-30 16:06:52] [INFO ] Flatten gal took : 57 ms
[2024-05-30 16:06:52] [INFO ] Applying decomposition
[2024-05-30 16:06:52] [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/graph7529492872649028896.txt' '-o' '/tmp/graph7529492872649028896.bin' '-w' '/tmp/graph7529492872649028896.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7529492872649028896.bin' '-l' '-1' '-v' '-w' '/tmp/graph7529492872649028896.weights' '-q' '0' '-e' '0.001'
[2024-05-30 16:06:52] [INFO ] Decomposing Gal with order
[2024-05-30 16:06:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 16:06:52] [INFO ] Removed a total of 240 redundant transitions.
[2024-05-30 16:06:52] [INFO ] Flatten gal took : 93 ms
[2024-05-30 16:06:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-30 16:06:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13994097020682441316.gal : 19 ms
[2024-05-30 16:06:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17891881033561467062.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/ReachabilityCardinality13994097020682441316.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17891881033561467062.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality17891881033561467062.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 244
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :244 after 1344
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :1344 after 5174
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :5174 after 5174
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :2.96732e+94 after 4.83383e+94
ITS-tools command line returned an error code 137
[2024-05-30 16:31:55] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1812111071240929941
[2024-05-30 16:31:55] [INFO ] Applying decomposition
[2024-05-30 16:31:55] [INFO ] Computing symmetric may disable matrix : 569 transitions.
[2024-05-30 16:31:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 16:31:55] [INFO ] Computing symmetric may enable matrix : 569 transitions.
[2024-05-30 16:31:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 16:31:55] [INFO ] Flatten gal took : 19 ms
[2024-05-30 16:31:55] [INFO ] Computing Do-Not-Accords matrix : 569 transitions.
[2024-05-30 16:31:55] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 16:31:55] [INFO ] Built C files in 207ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1812111071240929941
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/graph1411203094143803433.txt' '-o' '/tmp/graph1411203094143803433.bin' '-w' '/tmp/graph1411203094143803433.weights'
Running compilation step : cd /tmp/ltsmin1812111071240929941;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '144' '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/graph1411203094143803433.bin' '-l' '-1' '-v' '-w' '/tmp/graph1411203094143803433.weights' '-q' '0' '-e' '0.001'
[2024-05-30 16:31:55] [INFO ] Decomposing Gal with order
[2024-05-30 16:31:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 16:31:55] [INFO ] Removed a total of 888 redundant transitions.
[2024-05-30 16:31:55] [INFO ] Flatten gal took : 35 ms
[2024-05-30 16:31:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 362 labels/synchronizations in 12 ms.
[2024-05-30 16:31:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6465857031534023954.gal : 3 ms
[2024-05-30 16:31:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8507017928949127036.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/ReachabilityCardinality6465857031534023954.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8507017928949127036.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/ReachabilityCardinality8507017928949127036.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 14
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :14 after 14
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :14 after 420
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :420 after 7560
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,5.61142e+55,0.397305,21084,638,68,39217,294,795,68778,115,1298,0
Total reachable state count : 5.611423275543127881023738268833735001864e+55

Verifying 5 reachability properties.
Reachability property ShieldRVt-PT-040B-ReachabilityCardinality-2024-01 is true.
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityCardinality-2024-01,3.07215e+49,0.399033,21344,302,43,39217,294,796,68778,118,1298,8
Reachability property ShieldRVt-PT-040B-ReachabilityCardinality-2024-05 is true.
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityCardinality-2024-05,9.35241e+54,0.399421,21344,343,41,39217,294,796,68778,119,1298,8
Invariant property ShieldRVt-PT-040B-ReachabilityCardinality-2024-06 does not hold.
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityCardinality-2024-06,2.55943e+49,0.399673,21344,216,36,39217,294,798,68778,119,1298,8
Invariant property ShieldRVt-PT-040B-ReachabilityCardinality-2024-09 does not hold.
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityCardinality-2024-09,1.24701e+55,0.411132,21344,1074,63,39217,294,846,68778,125,1298,1766
Invariant property ShieldRVt-PT-040B-ReachabilityCardinality-2024-15 does not hold.
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-040B-ReachabilityCardinality-2024-15,3.74096e+54,0.411764,21344,345,43,39217,294,848,68778,126,1298,1802
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1600028 ms.

BK_STOP 1717086716389

--------------------
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="ShieldRVt-PT-040B"
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 ShieldRVt-PT-040B, 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 r356-tall-171683762301022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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