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.r158-smll-171636266300182.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 EisenbergMcGuire-PT-07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266300182
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 210K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 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 1.2M 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 EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-00
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-01
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-02
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-03
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-04
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-05
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-06
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-07
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-08
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-09
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-10
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-11
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-12
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-13
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-14
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716535739025

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-24 07:29:01] [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-24 07:29:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 07:29:02] [INFO ] Load time of PNML (sax parser for PT used): 603 ms
[2024-05-24 07:29:02] [INFO ] Transformed 553 places.
[2024-05-24 07:29:02] [INFO ] Transformed 1960 transitions.
[2024-05-24 07:29:02] [INFO ] Found NUPN structural information;
[2024-05-24 07:29:02] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 920 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 122 ms.
Working with output stream class java.io.PrintStream
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2586 ms. (15 steps per ms) remains 8/15 properties
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1035 ms. (38 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 681 ms. (58 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 418 ms. (95 steps per ms) remains 8/8 properties
[2024-05-24 07:29:04] [INFO ] Flatten gal took : 624 ms
BEST_FIRST walk for 40004 steps (8 resets) in 358 ms. (111 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 8/8 properties
[2024-05-24 07:29:04] [INFO ] Flatten gal took : 294 ms
BEST_FIRST walk for 40004 steps (8 resets) in 588 ms. (67 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 8/8 properties
[2024-05-24 07:29:04] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
[2024-05-24 07:29:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9322130678945781096.gal : 104 ms
// Phase 1: matrix 1001 rows 553 cols
[2024-05-24 07:29:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5714585572118046551.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/ReachabilityCardinality9322130678945781096.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5714585572118046551.prop' '--nowitness' '--gen-order' 'FOLLOW'
[2024-05-24 07:29:04] [INFO ] Computed 22 invariants in 27 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 ...328
[2024-05-24 07:29:04] [INFO ] State equation strengthened by 472 read => feed constraints.
Loading property file /tmp/ReachabilityCardinality5714585572118046551.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-00 is UNSAT
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-15 is UNSAT
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 408/539 variables, 14/145 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 408/553 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 1/554 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 0/554 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/546 variables, 6/560 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 7/567 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/567 constraints. Problems are: Problem set: 2 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :8 after 11
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :11 after 13
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :13 after 19
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :19 after 21
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :21 after 90
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :90 after 198
At refinement iteration 9 (OVERLAPS) 1001/1547 variables, 546/1113 constraints. Problems are: Problem set: 2 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :198 after 866
At refinement iteration 10 (INCLUDED_ONLY) 0/1547 variables, 472/1585 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1547 variables, 0/1585 constraints. Problems are: Problem set: 2 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :866 after 1663
At refinement iteration 12 (OVERLAPS) 7/1554 variables, 7/1592 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1554 variables, 7/1599 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1554 variables, 1/1600 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1554 variables, 0/1600 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/1554 variables, 0/1600 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1554/1554 variables, and 1600 constraints, problems are : Problem set: 2 solved, 6 unsolved in 2740 ms.
Refiners :[Domain max(s): 553/553 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 553/553 constraints, ReadFeed: 472/472 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :1663 after 6052
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 91/91 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 446/537 variables, 14/105 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/537 variables, 446/551 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-24 07:29:09] [INFO ] Deduced a trap composed of 3 places in 403 ms of which 32 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :6052 after 32347
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 1/552 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 0/552 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 9/546 variables, 7/559 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 9/568 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-24 07:29:11] [INFO ] Deduced a trap composed of 3 places in 664 ms of which 8 ms to minimize.
[2024-05-24 07:29:11] [INFO ] Deduced a trap composed of 29 places in 250 ms of which 4 ms to minimize.
[2024-05-24 07:29:11] [INFO ] Deduced a trap composed of 3 places in 369 ms of which 5 ms to minimize.
[2024-05-24 07:29:12] [INFO ] Deduced a trap composed of 3 places in 415 ms of which 5 ms to minimize.
[2024-05-24 07:29:12] [INFO ] Deduced a trap composed of 78 places in 367 ms of which 13 ms to minimize.
[2024-05-24 07:29:13] [INFO ] Deduced a trap composed of 26 places in 316 ms of which 4 ms to minimize.
SMT process timed out in 8278ms, After SMT, problems are : Problem set: 2 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 91 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 553 transition count 1956
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 549 transition count 1955
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 548 transition count 1955
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 10 place count 548 transition count 1849
Deduced a syphon composed of 106 places in 3 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 222 place count 442 transition count 1849
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 257 place count 407 transition count 1604
Iterating global reduction 3 with 35 rules applied. Total rules applied 292 place count 407 transition count 1604
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 4 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 364 place count 371 transition count 1568
Applied a total of 364 rules in 366 ms. Remains 371 /553 variables (removed 182) and now considering 1568/1960 (removed 392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 371/553 places, 1568/1960 transitions.
RANDOM walk for 40000 steps (8 resets) in 549 ms. (72 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 884 ms. (45 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 511 ms. (78 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 6/6 properties
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :32347 after 97921
Interrupted probabilistic random walk after 140616 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :2 out of 6
Probabilistic random walk after 140616 steps, saw 85260 distinct states, run finished after 3007 ms. (steps per millisecond=46 ) properties seen :2
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-24 07:29:17] [INFO ] Flow matrix only has 609 transitions (discarded 959 similar events)
// Phase 1: matrix 609 rows 371 cols
[2024-05-24 07:29:17] [INFO ] Computed 22 invariants in 6 ms
[2024-05-24 07:29:17] [INFO ] State equation strengthened by 262 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 280/355 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/364 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 609/973 variables, 364/385 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/973 variables, 262/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/973 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 7/980 variables, 7/654 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/980 variables, 1/655 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/980 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/980 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 980/980 variables, and 655 constraints, problems are : Problem set: 0 solved, 4 unsolved in 873 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 371/371 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 280/355 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 07:29:18] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 9/364 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 07:29:19] [INFO ] Deduced a trap composed of 3 places in 341 ms of which 5 ms to minimize.
[2024-05-24 07:29:19] [INFO ] Deduced a trap composed of 41 places in 348 ms of which 5 ms to minimize.
[2024-05-24 07:29:19] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 2 ms to minimize.
[2024-05-24 07:29:19] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 3 ms to minimize.
[2024-05-24 07:29:20] [INFO ] Deduced a trap composed of 43 places in 249 ms of which 3 ms to minimize.
[2024-05-24 07:29:20] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 3 ms to minimize.
[2024-05-24 07:29:20] [INFO ] Deduced a trap composed of 26 places in 256 ms of which 3 ms to minimize.
[2024-05-24 07:29:20] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 2 ms to minimize.
[2024-05-24 07:29:20] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-24 07:29:21] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 3 ms to minimize.
[2024-05-24 07:29:21] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 3 ms to minimize.
[2024-05-24 07:29:21] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 3 ms to minimize.
[2024-05-24 07:29:21] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 2 ms to minimize.
[2024-05-24 07:29:21] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
Problem EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-01 is UNSAT
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-01 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-24 07:29:21] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
[2024-05-24 07:29:22] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 2 ms to minimize.
[2024-05-24 07:29:22] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
[2024-05-24 07:29:22] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 2 ms to minimize.
[2024-05-24 07:29:22] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 2 ms to minimize.
Problem EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-09 is UNSAT
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-24 07:29:22] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 4 ms to minimize.
Problem EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-01 is UNSAT
Problem EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-09 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 20/42 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-24 07:29:22] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 2 ms to minimize.
[2024-05-24 07:29:22] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 2 ms to minimize.
[2024-05-24 07:29:22] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 6 ms to minimize.
[2024-05-24 07:29:23] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 4/46 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/46 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 609/973 variables, 364/410 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/973 variables, 262/672 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/973 variables, 0/672 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 7/980 variables, 7/679 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/980 variables, 1/680 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/980 variables, 2/682 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-24 07:29:23] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/980 variables, 1/683 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/980 variables, 0/683 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/980 variables, 0/683 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 980/980 variables, and 683 constraints, problems are : Problem set: 2 solved, 2 unsolved in 5938 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 371/371 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 26/26 constraints]
After SMT, in 6893ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 587 ms.
Support contains 42 out of 371 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 371/371 places, 1568/1568 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 0 place count 371 transition count 1544
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 347 transition count 1544
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 342 transition count 1509
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 342 transition count 1509
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 341 transition count 1508
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :97921 after 151556
Applied a total of 60 rules in 188 ms. Remains 341 /371 variables (removed 30) and now considering 1508/1568 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 341/371 places, 1508/1568 transitions.
RANDOM walk for 40000 steps (8 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 234304 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 2
Probabilistic random walk after 234304 steps, saw 127922 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2024-05-24 07:29:28] [INFO ] Flow matrix only has 549 transitions (discarded 959 similar events)
// Phase 1: matrix 549 rows 341 cols
[2024-05-24 07:29:28] [INFO ] Computed 22 invariants in 4 ms
[2024-05-24 07:29:28] [INFO ] State equation strengthened by 232 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 282/324 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/334 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 549/883 variables, 334/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 232/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/883 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/890 variables, 7/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/890 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/890 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/890 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 890/890 variables, and 595 constraints, problems are : Problem set: 0 solved, 2 unsolved in 536 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 341/341 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 282/324 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/334 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 07:29:29] [INFO ] Deduced a trap composed of 3 places in 213 ms of which 3 ms to minimize.
[2024-05-24 07:29:29] [INFO ] Deduced a trap composed of 3 places in 217 ms of which 11 ms to minimize.
[2024-05-24 07:29:29] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-05-24 07:29:29] [INFO ] Deduced a trap composed of 33 places in 329 ms of which 4 ms to minimize.
[2024-05-24 07:29:30] [INFO ] Deduced a trap composed of 18 places in 266 ms of which 4 ms to minimize.
[2024-05-24 07:29:30] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 3 ms to minimize.
[2024-05-24 07:29:30] [INFO ] Deduced a trap composed of 50 places in 134 ms of which 3 ms to minimize.
[2024-05-24 07:29:30] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 3 ms to minimize.
[2024-05-24 07:29:30] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2024-05-24 07:29:30] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 07:29:30] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 2 ms to minimize.
[2024-05-24 07:29:30] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 07:29:31] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 2 ms to minimize.
[2024-05-24 07:29:31] [INFO ] Deduced a trap composed of 53 places in 175 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 549/883 variables, 334/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/883 variables, 232/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/883 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 7/890 variables, 7/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/890 variables, 1/609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/890 variables, 2/611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/890 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 07:29:32] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/890 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/890 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/890 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 890/890 variables, and 612 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3820 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 341/341 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 15/15 constraints]
After SMT, in 4412ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 713 ms.
Support contains 42 out of 341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 341/341 places, 1508/1508 transitions.
Applied a total of 0 rules in 78 ms. Remains 341 /341 variables (removed 0) and now considering 1508/1508 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 341/341 places, 1508/1508 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 341/341 places, 1508/1508 transitions.
Applied a total of 0 rules in 77 ms. Remains 341 /341 variables (removed 0) and now considering 1508/1508 (removed 0) transitions.
[2024-05-24 07:29:33] [INFO ] Flow matrix only has 549 transitions (discarded 959 similar events)
[2024-05-24 07:29:33] [INFO ] Invariant cache hit.
[2024-05-24 07:29:33] [INFO ] Implicit Places using invariants in 467 ms returned []
[2024-05-24 07:29:33] [INFO ] Flow matrix only has 549 transitions (discarded 959 similar events)
[2024-05-24 07:29:33] [INFO ] Invariant cache hit.
[2024-05-24 07:29:34] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-05-24 07:29:36] [INFO ] Implicit Places using invariants and state equation in 2149 ms returned []
Implicit Place search using SMT with State Equation took 2635 ms to find 0 implicit places.
[2024-05-24 07:29:36] [INFO ] Redundant transitions in 166 ms returned []
Running 1501 sub problems to find dead transitions.
[2024-05-24 07:29:36] [INFO ] Flow matrix only has 549 transitions (discarded 959 similar events)
[2024-05-24 07:29:36] [INFO ] Invariant cache hit.
[2024-05-24 07:29:36] [INFO ] State equation strengthened by 232 read => feed constraints.
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :151556 after 1.1069e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/341 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1501 unsolved
[2024-05-24 07:29:53] [INFO ] Deduced a trap composed of 32 places in 440 ms of which 6 ms to minimize.
[2024-05-24 07:29:54] [INFO ] Deduced a trap composed of 3 places in 402 ms of which 4 ms to minimize.
[2024-05-24 07:29:54] [INFO ] Deduced a trap composed of 67 places in 216 ms of which 4 ms to minimize.
[2024-05-24 07:29:55] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-05-24 07:29:56] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 3 ms to minimize.
[2024-05-24 07:29:56] [INFO ] Deduced a trap composed of 68 places in 208 ms of which 3 ms to minimize.
[2024-05-24 07:29:56] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-24 07:29:56] [INFO ] Deduced a trap composed of 78 places in 207 ms of which 14 ms to minimize.
[2024-05-24 07:29:56] [INFO ] Deduced a trap composed of 69 places in 371 ms of which 4 ms to minimize.
[2024-05-24 07:29:57] [INFO ] Deduced a trap composed of 70 places in 310 ms of which 3 ms to minimize.
[2024-05-24 07:29:57] [INFO ] Deduced a trap composed of 75 places in 499 ms of which 5 ms to minimize.
[2024-05-24 07:29:58] [INFO ] Deduced a trap composed of 61 places in 496 ms of which 5 ms to minimize.
[2024-05-24 07:29:58] [INFO ] Deduced a trap composed of 62 places in 514 ms of which 5 ms to minimize.
[2024-05-24 07:29:59] [INFO ] Deduced a trap composed of 24 places in 441 ms of which 5 ms to minimize.
[2024-05-24 07:29:59] [INFO ] Deduced a trap composed of 3 places in 446 ms of which 5 ms to minimize.
[2024-05-24 07:30:00] [INFO ] Deduced a trap composed of 12 places in 386 ms of which 6 ms to minimize.
[2024-05-24 07:30:00] [INFO ] Deduced a trap composed of 71 places in 366 ms of which 5 ms to minimize.
[2024-05-24 07:30:01] [INFO ] Deduced a trap composed of 66 places in 418 ms of which 6 ms to minimize.
[2024-05-24 07:30:01] [INFO ] Deduced a trap composed of 60 places in 477 ms of which 6 ms to minimize.
[2024-05-24 07:30:02] [INFO ] Deduced a trap composed of 58 places in 466 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1501 unsolved
[2024-05-24 07:30:04] [INFO ] Deduced a trap composed of 80 places in 249 ms of which 5 ms to minimize.
[2024-05-24 07:30:04] [INFO ] Deduced a trap composed of 69 places in 344 ms of which 4 ms to minimize.
[2024-05-24 07:30:04] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-05-24 07:30:05] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
[2024-05-24 07:30:05] [INFO ] Deduced a trap composed of 54 places in 441 ms of which 6 ms to minimize.
[2024-05-24 07:30:05] [INFO ] Deduced a trap composed of 18 places in 329 ms of which 5 ms to minimize.
[2024-05-24 07:30:06] [INFO ] Deduced a trap composed of 16 places in 319 ms of which 4 ms to minimize.
[2024-05-24 07:30:06] [INFO ] Deduced a trap composed of 21 places in 431 ms of which 5 ms to minimize.
[2024-05-24 07:30:07] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 2 ms to minimize.
[2024-05-24 07:30:07] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 2 ms to minimize.
[2024-05-24 07:30:07] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-05-24 07:30:07] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
SMT process timed out in 31387ms, After SMT, problems are : Problem set: 0 solved, 1501 unsolved
Search for dead transitions found 0 dead transitions in 31423ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34337 ms. Remains : 341/341 places, 1508/1508 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1230 edges and 341 vertex of which 42 / 341 are part of one of the 7 SCC in 13 ms
Free SCC test removed 35 places
Drop transitions (Empty/Sink Transition effects.) removed 125 transitions
Ensure Unique test removed 946 transitions
Reduce isomorphic transitions removed 1071 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 306 transition count 385
Reduce places removed 52 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 59 rules applied. Total rules applied 112 place count 254 transition count 378
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 119 place count 247 transition count 378
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 119 place count 247 transition count 370
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 136 place count 238 transition count 370
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 270 place count 171 transition count 303
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 295 place count 171 transition count 278
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 301 place count 168 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 317 place count 168 transition count 273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 319 place count 167 transition count 275
Free-agglomeration rule applied 37 times.
Iterating global reduction 4 with 37 rules applied. Total rules applied 356 place count 167 transition count 238
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 393 place count 130 transition count 238
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 398 place count 130 transition count 238
Applied a total of 398 rules in 155 ms. Remains 130 /341 variables (removed 211) and now considering 238/1508 (removed 1270) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 238 rows 130 cols
[2024-05-24 07:30:07] [INFO ] Computed 21 invariants in 3 ms
[2024-05-24 07:30:07] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 07:30:08] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-24 07:30:08] [INFO ] [Nat]Absence check using 15 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 07:30:08] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 07:30:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 07:30:08] [INFO ] After 41ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 07:30:08] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-24 07:30:08] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-24 07:30:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
TRAPS : Iteration 1
[2024-05-24 07:30:08] [INFO ] After 252ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 07:30:08] [INFO ] After 544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-24 07:30:08] [INFO ] Flatten gal took : 17 ms
[2024-05-24 07:30:08] [INFO ] Flatten gal took : 14 ms
[2024-05-24 07:30:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality257614782306120905.gal : 4 ms
[2024-05-24 07:30:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13277972886130271246.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/ReachabilityCardinality257614782306120905.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13277972886130271246.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/ReachabilityCardinality13277972886130271246.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 29
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :29 after 54
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :54 after 2100
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2100 after 13370
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :13370 after 15330
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :15330 after 45360
Reachability property EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-13 is true.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :45360 after 1.76766e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.76766e+06 after 1.80855e+06
Reachability property EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-06 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6.58748e+08,2.84471,7544,2,1670,17,19573,6,0,761,11530,0
Total reachable state count : 658748160

Verifying 2 reachability properties.
SDD proceeding with computation,8 properties remain. new max is 131072
SDD size :1.1069e+06 after 2.49336e+06
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 15945 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 07:30:23] [INFO ] Flatten gal took : 97 ms
[2024-05-24 07:30:23] [INFO ] Applying decomposition
[2024-05-24 07:30:23] [INFO ] Flatten gal took : 84 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/graph11479932217317199567.txt' '-o' '/tmp/graph11479932217317199567.bin' '-w' '/tmp/graph11479932217317199567.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11479932217317199567.bin' '-l' '-1' '-v' '-w' '/tmp/graph11479932217317199567.weights' '-q' '0' '-e' '0.001'
[2024-05-24 07:30:24] [INFO ] Decomposing Gal with order
[2024-05-24 07:30:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 07:30:25] [INFO ] Removed a total of 3574 redundant transitions.
[2024-05-24 07:30:25] [INFO ] Flatten gal took : 549 ms
[2024-05-24 07:30:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 490 labels/synchronizations in 152 ms.
[2024-05-24 07:30:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11902469656451488919.gal : 32 ms
[2024-05-24 07:30:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8024439289260767061.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/ReachabilityCardinality11902469656451488919.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8024439289260767061.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/ReachabilityCardinality8024439289260767061.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4 after 4
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :4 after 24
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :24 after 424
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :424 after 926
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :926 after 18716
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :18716 after 208231
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :208231 after 984910
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :984910 after 2.61713e+07
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.61713e+07 after 5.93993e+07
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :5.93993e+07 after 7.13244e+07
ITS-tools command line returned an error code 137
[2024-05-24 07:48:29] [INFO ] Flatten gal took : 108 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5752208453742611904
[2024-05-24 07:48:29] [INFO ] Too many transitions (1508) to apply POR reductions. Disabling POR matrices.
[2024-05-24 07:48:29] [INFO ] Applying decomposition
[2024-05-24 07:48:29] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5752208453742611904
[2024-05-24 07:48:29] [INFO ] Flatten gal took : 85 ms
Running compilation step : cd /tmp/ltsmin5752208453742611904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph11569555309669411852.txt' '-o' '/tmp/graph11569555309669411852.bin' '-w' '/tmp/graph11569555309669411852.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11569555309669411852.bin' '-l' '-1' '-v' '-w' '/tmp/graph11569555309669411852.weights' '-q' '0' '-e' '0.001'
[2024-05-24 07:48:29] [INFO ] Decomposing Gal with order
[2024-05-24 07:48:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 07:48:30] [INFO ] Removed a total of 2867 redundant transitions.
[2024-05-24 07:48:30] [INFO ] Flatten gal took : 254 ms
[2024-05-24 07:48:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 477 labels/synchronizations in 60 ms.
[2024-05-24 07:48:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7025244656286331825.gal : 24 ms
[2024-05-24 07:48:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12247472583373386284.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/ReachabilityCardinality7025244656286331825.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12247472583373386284.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/ReachabilityCardinality12247472583373386284.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 1664
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1664 after 11644
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :11644 after 12176
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :12176 after 37430
Compilation finished in 7109 ms.
Running link step : cd /tmp/ltsmin5752208453742611904;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin5752208453742611904;'/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' 'EisenbergMcGuirePT07ReachabilityCardinality202306==true'
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :37430 after 231330
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :231330 after 7.57234e+06
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :7.57234e+06 after 5.57585e+07
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin5752208453742611904;'/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' 'EisenbergMcGuirePT07ReachabilityCardinality202306==true'
Running LTSmin : cd /tmp/ltsmin5752208453742611904;'/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' 'EisenbergMcGuirePT07ReachabilityCardinality202313==true'
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5.57585e+07 after 1.08646e+08
Detected timeout of ITS tools.
[2024-05-24 08:14:59] [INFO ] Flatten gal took : 178 ms
[2024-05-24 08:15:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16824496053340538798.gal : 45 ms
[2024-05-24 08:15:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12285403388176611233.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/ReachabilityCardinality16824496053340538798.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12285403388176611233.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/ReachabilityCardinality12285403388176611233.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 8
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :8 after 31
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :31 after 39
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :39 after 95
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :95 after 355
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :355 after 864
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :864 after 1797
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1797 after 5847
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5847 after 18981
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :18981 after 58036
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :58036 after 148460
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :148460 after 253307
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin5752208453742611904;'/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' 'EisenbergMcGuirePT07ReachabilityCardinality202313==true'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin5752208453742611904;'/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' 'EisenbergMcGuirePT07ReachabilityCardinality202306==true'
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :253307 after 1.25487e+06
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :1.25487e+06 after 4.44647e+06

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="EisenbergMcGuire-PT-07"
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 EisenbergMcGuire-PT-07, 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 r158-smll-171636266300182"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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