About the Execution of ITS-Tools for PolyORBLF-PT-S04J06T08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 554446.00 | 0.00 | 0.00 | TTFFFFT?FFTFTFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446800302.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-PT-S04J06T08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446800302
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.5M
-rw-r--r-- 1 mcc users 22K Apr 11 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 11 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 127K Apr 11 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 570K Apr 11 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 41K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 205K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 138K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 670K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.5M 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 PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716918940992
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-28 17:55:42] [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-28 17:55:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:55:42] [INFO ] Load time of PNML (sax parser for PT used): 311 ms
[2024-05-28 17:55:42] [INFO ] Transformed 792 places.
[2024-05-28 17:55:42] [INFO ] Transformed 4268 transitions.
[2024-05-28 17:55:42] [INFO ] Parsed PT model containing 792 places and 4268 transitions and 28832 arcs in 488 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
RANDOM walk for 40000 steps (9 resets) in 2904 ms. (13 steps per ms) remains 12/16 properties
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 600 ms. (66 steps per ms) remains 12/12 properties
[2024-05-28 17:55:44] [INFO ] Flatten gal took : 537 ms
BEST_FIRST walk for 40001 steps (8 resets) in 1079 ms. (37 steps per ms) remains 12/12 properties
[2024-05-28 17:55:44] [INFO ] Flatten gal took : 285 ms
BEST_FIRST walk for 40002 steps (8 resets) in 937 ms. (42 steps per ms) remains 12/12 properties
[2024-05-28 17:55:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18349173434703343171.gal : 120 ms
[2024-05-28 17:55:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11820090549186597926.prop : 29 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/ReachabilityCardinality18349173434703343171.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11820090549186597926.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (8 resets) in 453 ms. (88 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 320 ms. (124 steps per ms) remains 12/12 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40002 steps (8 resets) in 397 ms. (100 steps per ms) remains 12/12 properties
Loading property file /tmp/ReachabilityCardinality11820090549186597926.prop.
BEST_FIRST walk for 40003 steps (8 resets) in 788 ms. (50 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 417 ms. (95 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (9 resets) in 457 ms. (87 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 383 ms. (104 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 323 ms. (123 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 481 ms. (82 steps per ms) remains 12/12 properties
[2024-05-28 17:55:46] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 792 cols
[2024-05-28 17:55:46] [INFO ] Computed 58 invariants in 119 ms
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 3
[2024-05-28 17:55:46] [INFO ] State equation strengthened by 160 read => feed constraints.
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :7 after 12
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :12 after 13
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :13 after 14
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :14 after 24
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :24 after 27
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :27 after 31
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/636 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 45/681 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/681 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 8/689 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-01 is UNSAT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-02 is UNSAT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-03 is UNSAT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-04 is UNSAT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-05 is UNSAT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-09 is UNSAT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-12 is UNSAT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-14 is UNSAT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-15 is UNSAT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 100/789 variables, 33/55 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/789 variables, 0/55 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/792 variables, 3/58 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/792 variables, 0/58 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2068/2860 variables, 792/850 constraints. Problems are: Problem set: 9 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2860/2860 variables, and 1010 constraints, problems are : Problem set: 9 solved, 3 unsolved in 5104 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 792/792 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 12/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 3 unsolved
[2024-05-28 17:55:52] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 13 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 1/2 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/2 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 98/412 variables, 8/10 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 0/10 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/420 variables, 2/12 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/12 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 367/787 variables, 42/54 constraints. Problems are: Problem set: 9 solved, 3 unsolved
[2024-05-28 17:55:53] [INFO ] Deduced a trap composed of 83 places in 570 ms of which 22 ms to minimize.
[2024-05-28 17:55:54] [INFO ] Deduced a trap composed of 83 places in 1572 ms of which 13 ms to minimize.
[2024-05-28 17:55:55] [INFO ] Deduced a trap composed of 84 places in 406 ms of which 5 ms to minimize.
[2024-05-28 17:55:55] [INFO ] Deduced a trap composed of 83 places in 444 ms of which 4 ms to minimize.
[2024-05-28 17:55:56] [INFO ] Deduced a trap composed of 83 places in 354 ms of which 4 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :31 after 185040
[2024-05-28 17:55:56] [INFO ] Deduced a trap composed of 155 places in 451 ms of which 4 ms to minimize.
[2024-05-28 17:55:56] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 2 ms to minimize.
[2024-05-28 17:55:56] [INFO ] Deduced a trap composed of 83 places in 56 ms of which 0 ms to minimize.
[2024-05-28 17:55:57] [INFO ] Deduced a trap composed of 83 places in 378 ms of which 4 ms to minimize.
SMT process timed out in 11049ms, After SMT, problems are : Problem set: 9 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 314 out of 792 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 788 transition count 2076
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 52 place count 764 transition count 2076
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 52 place count 764 transition count 2013
Deduced a syphon composed of 63 places in 3 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 178 place count 701 transition count 2013
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 194 place count 693 transition count 2005
Applied a total of 194 rules in 364 ms. Remains 693 /792 variables (removed 99) and now considering 2005/2100 (removed 95) transitions.
Running 2001 sub problems to find dead transitions.
[2024-05-28 17:55:57] [INFO ] Flow matrix only has 1973 transitions (discarded 32 similar events)
// Phase 1: matrix 1973 rows 693 cols
[2024-05-28 17:55:57] [INFO ] Computed 54 invariants in 154 ms
[2024-05-28 17:55:57] [INFO ] State equation strengthened by 160 read => feed constraints.
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :185040 after 205664
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :205664 after 1.51122e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/689 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2001 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/689 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 2001 unsolved
[2024-05-28 17:56:23] [INFO ] Deduced a trap composed of 3 places in 586 ms of which 2 ms to minimize.
[2024-05-28 17:56:28] [INFO ] Deduced a trap composed of 123 places in 169 ms of which 3 ms to minimize.
SMT process timed out in 30586ms, After SMT, problems are : Problem set: 0 solved, 2001 unsolved
Search for dead transitions found 0 dead transitions in 30636ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31036 ms. Remains : 693/792 places, 2005/2100 transitions.
RANDOM walk for 40000 steps (9 resets) in 830 ms. (48 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 529 ms. (75 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 229 ms. (173 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 98288 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :1 out of 3
Probabilistic random walk after 98288 steps, saw 66148 distinct states, run finished after 3004 ms. (steps per millisecond=32 ) properties seen :1
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-28 17:56:31] [INFO ] Flow matrix only has 1973 transitions (discarded 32 similar events)
[2024-05-28 17:56:31] [INFO ] Invariant cache hit.
[2024-05-28 17:56:31] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 82/395 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 8/403 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 275/678 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/678 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/685 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/685 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 8/693 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/693 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,12 properties remain. new max is 16384
SDD size :1.51122e+06 after 1.5978e+06
At refinement iteration 12 (OVERLAPS) 1973/2666 variables, 693/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2666 variables, 160/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2666 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/2666 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2666/2666 variables, and 907 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6664 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 693/693 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:56:38] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 82/395 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/403 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 275/678 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:56:39] [INFO ] Deduced a trap composed of 72 places in 410 ms of which 4 ms to minimize.
[2024-05-28 17:56:39] [INFO ] Deduced a trap composed of 73 places in 357 ms of which 4 ms to minimize.
[2024-05-28 17:56:39] [INFO ] Deduced a trap composed of 73 places in 315 ms of which 3 ms to minimize.
[2024-05-28 17:56:40] [INFO ] Deduced a trap composed of 72 places in 331 ms of which 4 ms to minimize.
[2024-05-28 17:56:40] [INFO ] Deduced a trap composed of 72 places in 308 ms of which 3 ms to minimize.
[2024-05-28 17:56:40] [INFO ] Deduced a trap composed of 72 places in 313 ms of which 3 ms to minimize.
[2024-05-28 17:56:41] [INFO ] Deduced a trap composed of 379 places in 309 ms of which 4 ms to minimize.
[2024-05-28 17:56:41] [INFO ] Deduced a trap composed of 71 places in 321 ms of which 3 ms to minimize.
[2024-05-28 17:56:41] [INFO ] Deduced a trap composed of 327 places in 321 ms of which 3 ms to minimize.
Problem PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-08 is UNSAT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (INCLUDED_ONLY) 0/678 variables, 9/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 17:56:42] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/678 variables, 1/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/678 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/685 variables, 5/57 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 17:56:42] [INFO ] Deduced a trap composed of 389 places in 311 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/685 variables, 1/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/685 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/693 variables, 8/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/693 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1973/2666 variables, 693/759 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2666 variables, 160/919 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 17:56:47] [INFO ] Deduced a trap composed of 19 places in 419 ms of which 5 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2666 variables, 1/920 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2666 variables, 0/920 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/2666 variables, 0/920 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2666/2666 variables, and 920 constraints, problems are : Problem set: 1 solved, 1 unsolved in 10147 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 693/693 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 16896ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 60 ms.
Support contains 312 out of 693 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 693/693 places, 2005/2005 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 693 transition count 2004
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 692 transition count 2004
Applied a total of 2 rules in 123 ms. Remains 692 /693 variables (removed 1) and now considering 2004/2005 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 692/693 places, 2004/2005 transitions.
RANDOM walk for 40000 steps (13 resets) in 615 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 702 ms. (56 steps per ms) remains 1/1 properties
SDD proceeding with computation,12 properties remain. new max is 32768
SDD size :1.5978e+06 after 1.6261e+06
Interrupted probabilistic random walk after 118000 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 1
Probabilistic random walk after 118000 steps, saw 79151 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
[2024-05-28 17:56:52] [INFO ] Flow matrix only has 1972 transitions (discarded 32 similar events)
// Phase 1: matrix 1972 rows 692 cols
[2024-05-28 17:56:52] [INFO ] Computed 54 invariants in 34 ms
[2024-05-28 17:56:52] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 70/382 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/394 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 282/676 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/684 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/684 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/692 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/692 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1972/2664 variables, 692/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2664 variables, 160/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2664 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2664 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2664/2664 variables, and 906 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2070 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 692/692 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:56:54] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/382 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/394 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 282/676 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:56:55] [INFO ] Deduced a trap composed of 72 places in 505 ms of which 4 ms to minimize.
[2024-05-28 17:56:55] [INFO ] Deduced a trap composed of 72 places in 392 ms of which 4 ms to minimize.
[2024-05-28 17:56:56] [INFO ] Deduced a trap composed of 71 places in 344 ms of which 4 ms to minimize.
[2024-05-28 17:56:56] [INFO ] Deduced a trap composed of 71 places in 338 ms of which 3 ms to minimize.
[2024-05-28 17:56:56] [INFO ] Deduced a trap composed of 72 places in 335 ms of which 4 ms to minimize.
[2024-05-28 17:56:57] [INFO ] Deduced a trap composed of 391 places in 333 ms of which 3 ms to minimize.
[2024-05-28 17:56:57] [INFO ] Deduced a trap composed of 360 places in 352 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/676 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/676 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/684 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/684 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/692 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:56:57] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/692 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/692 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1972/2664 variables, 692/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2664 variables, 160/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:57:05] [INFO ] Deduced a trap composed of 19 places in 422 ms of which 5 ms to minimize.
[2024-05-28 17:57:06] [INFO ] Deduced a trap composed of 367 places in 437 ms of which 4 ms to minimize.
[2024-05-28 17:57:06] [INFO ] Deduced a trap composed of 395 places in 338 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2664 variables, 3/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2664 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2664 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2664/2664 variables, and 918 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12850 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 692/692 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 12/12 constraints]
After SMT, in 15021ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 82 ms.
Support contains 312 out of 692 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 692/692 places, 2004/2004 transitions.
Applied a total of 0 rules in 58 ms. Remains 692 /692 variables (removed 0) and now considering 2004/2004 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 692/692 places, 2004/2004 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 692/692 places, 2004/2004 transitions.
Applied a total of 0 rules in 73 ms. Remains 692 /692 variables (removed 0) and now considering 2004/2004 (removed 0) transitions.
[2024-05-28 17:57:07] [INFO ] Flow matrix only has 1972 transitions (discarded 32 similar events)
[2024-05-28 17:57:07] [INFO ] Invariant cache hit.
[2024-05-28 17:57:08] [INFO ] Implicit Places using invariants in 572 ms returned [2, 117, 128, 189, 258, 305, 338, 507]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 580 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 684/692 places, 2004/2004 transitions.
Applied a total of 0 rules in 33 ms. Remains 684 /684 variables (removed 0) and now considering 2004/2004 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 689 ms. Remains : 684/692 places, 2004/2004 transitions.
RANDOM walk for 40000 steps (9 resets) in 618 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 415 ms. (96 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 121924 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 1
Probabilistic random walk after 121924 steps, saw 81568 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2024-05-28 17:57:11] [INFO ] Flow matrix only has 1972 transitions (discarded 32 similar events)
// Phase 1: matrix 1972 rows 684 cols
[2024-05-28 17:57:11] [INFO ] Computed 46 invariants in 41 ms
[2024-05-28 17:57:11] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 134/446 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 13/459 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 222/681 variables, 26/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/681 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/684 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/684 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1972/2656 variables, 684/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2656 variables, 160/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2656 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2656 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2656/2656 variables, and 890 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2890 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 684/684 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:57:14] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 134/446 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/459 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 222/681 variables, 26/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:57:15] [INFO ] Deduced a trap composed of 72 places in 451 ms of which 5 ms to minimize.
[2024-05-28 17:57:15] [INFO ] Deduced a trap composed of 72 places in 377 ms of which 4 ms to minimize.
[2024-05-28 17:57:16] [INFO ] Deduced a trap composed of 72 places in 351 ms of which 3 ms to minimize.
[2024-05-28 17:57:16] [INFO ] Deduced a trap composed of 72 places in 306 ms of which 3 ms to minimize.
[2024-05-28 17:57:16] [INFO ] Deduced a trap composed of 72 places in 325 ms of which 4 ms to minimize.
[2024-05-28 17:57:17] [INFO ] Deduced a trap composed of 214 places in 293 ms of which 4 ms to minimize.
[2024-05-28 17:57:17] [INFO ] Deduced a trap composed of 399 places in 305 ms of which 3 ms to minimize.
[2024-05-28 17:57:17] [INFO ] Deduced a trap composed of 501 places in 326 ms of which 4 ms to minimize.
[2024-05-28 17:57:18] [INFO ] Deduced a trap composed of 508 places in 293 ms of which 4 ms to minimize.
[2024-05-28 17:57:18] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/681 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/681 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/684 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/684 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1972/2656 variables, 684/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2656 variables, 160/901 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2656 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2656 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2656/2656 variables, and 901 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8481 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 684/684 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 11/11 constraints]
After SMT, in 11515ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 86 ms.
Support contains 312 out of 684 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 684/684 places, 2004/2004 transitions.
Applied a total of 0 rules in 62 ms. Remains 684 /684 variables (removed 0) and now considering 2004/2004 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 684/684 places, 2004/2004 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 684/684 places, 2004/2004 transitions.
Applied a total of 0 rules in 44 ms. Remains 684 /684 variables (removed 0) and now considering 2004/2004 (removed 0) transitions.
[2024-05-28 17:57:23] [INFO ] Flow matrix only has 1972 transitions (discarded 32 similar events)
[2024-05-28 17:57:23] [INFO ] Invariant cache hit.
[2024-05-28 17:57:23] [INFO ] Implicit Places using invariants in 662 ms returned []
[2024-05-28 17:57:23] [INFO ] Flow matrix only has 1972 transitions (discarded 32 similar events)
[2024-05-28 17:57:23] [INFO ] Invariant cache hit.
[2024-05-28 17:57:26] [INFO ] State equation strengthened by 160 read => feed constraints.
SDD proceeding with computation,12 properties remain. new max is 65536
SDD size :1.6261e+06 after 1.65708e+06
[2024-05-28 17:57:53] [INFO ] Implicit Places using invariants and state equation in 29492 ms returned []
Implicit Place search using SMT with State Equation took 30157 ms to find 0 implicit places.
[2024-05-28 17:57:53] [INFO ] Redundant transitions in 178 ms returned []
Running 2000 sub problems to find dead transitions.
[2024-05-28 17:57:53] [INFO ] Flow matrix only has 1972 transitions (discarded 32 similar events)
[2024-05-28 17:57:53] [INFO ] Invariant cache hit.
[2024-05-28 17:57:53] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-28 17:58:19] [INFO ] Deduced a trap composed of 316 places in 262 ms of which 3 ms to minimize.
[2024-05-28 17:58:19] [INFO ] Deduced a trap composed of 310 places in 261 ms of which 3 ms to minimize.
[2024-05-28 17:58:21] [INFO ] Deduced a trap composed of 122 places in 475 ms of which 3 ms to minimize.
[2024-05-28 17:58:21] [INFO ] Deduced a trap composed of 180 places in 294 ms of which 3 ms to minimize.
[2024-05-28 17:58:21] [INFO ] Deduced a trap composed of 175 places in 274 ms of which 3 ms to minimize.
[2024-05-28 17:58:22] [INFO ] Deduced a trap composed of 310 places in 236 ms of which 2 ms to minimize.
[2024-05-28 17:58:22] [INFO ] Deduced a trap composed of 303 places in 225 ms of which 3 ms to minimize.
[2024-05-28 17:58:22] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 8 ms to minimize.
[2024-05-28 17:58:25] [INFO ] Deduced a trap composed of 93 places in 166 ms of which 2 ms to minimize.
[2024-05-28 17:58:28] [INFO ] Deduced a trap composed of 320 places in 259 ms of which 2 ms to minimize.
[2024-05-28 17:58:28] [INFO ] Deduced a trap composed of 314 places in 232 ms of which 3 ms to minimize.
[2024-05-28 17:58:30] [INFO ] Deduced a trap composed of 295 places in 327 ms of which 4 ms to minimize.
[2024-05-28 17:58:31] [INFO ] Deduced a trap composed of 54 places in 350 ms of which 3 ms to minimize.
[2024-05-28 17:58:32] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2656 variables, and 55 constraints, problems are : Problem set: 0 solved, 2000 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2000/2000 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-28 17:58:42] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 2 ms to minimize.
[2024-05-28 17:58:42] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:58:42] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 0 ms to minimize.
[2024-05-28 17:58:42] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:58:44] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 1 ms to minimize.
[2024-05-28 17:58:44] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2656 variables, and 61 constraints, problems are : Problem set: 0 solved, 2000 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2000 constraints, Known Traps: 20/20 constraints]
After SMT, in 69719ms problems are : Problem set: 0 solved, 2000 unsolved
Search for dead transitions found 0 dead transitions in 69744ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100139 ms. Remains : 684/684 places, 2004/2004 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 684 transition count 1972
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 48 place count 676 transition count 1988
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 80 place count 676 transition count 1956
Applied a total of 80 rules in 84 ms. Remains 676 /684 variables (removed 8) and now considering 1956/2004 (removed 48) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1956 rows 676 cols
[2024-05-28 17:59:03] [INFO ] Computed 46 invariants in 57 ms
[2024-05-28 17:59:03] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 17:59:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-05-28 17:59:03] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 57 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-28 17:59:05] [INFO ] After 1313ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :1
[2024-05-28 17:59:05] [INFO ] After 1495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-28 17:59:05] [INFO ] Flatten gal took : 131 ms
[2024-05-28 17:59:05] [INFO ] Flatten gal took : 90 ms
[2024-05-28 17:59:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8587079275314755879.gal : 18 ms
[2024-05-28 17:59:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8090821358089530159.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/ReachabilityCardinality8587079275314755879.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8090821358089530159.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/ReachabilityCardinality8090821358089530159.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 14
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 16
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :16 after 18
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :18 after 21
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :21 after 28
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :28 after 231
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :231 after 519
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :519 after 10355
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :10355 after 187903
Detected timeout of ITS tools.
[2024-05-28 17:59:20] [INFO ] Flatten gal took : 78 ms
[2024-05-28 17:59:20] [INFO ] Applying decomposition
[2024-05-28 17:59:20] [INFO ] Flatten gal took : 78 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/graph1549321954776804462.txt' '-o' '/tmp/graph1549321954776804462.bin' '-w' '/tmp/graph1549321954776804462.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1549321954776804462.bin' '-l' '-1' '-v' '-w' '/tmp/graph1549321954776804462.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:59:21] [INFO ] Decomposing Gal with order
[2024-05-28 17:59:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:59:22] [INFO ] Removed a total of 2431 redundant transitions.
[2024-05-28 17:59:22] [INFO ] Flatten gal took : 895 ms
[2024-05-28 17:59:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 2494 labels/synchronizations in 193 ms.
[2024-05-28 17:59:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7056776442388479570.gal : 20 ms
[2024-05-28 17:59:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4601154836894218456.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/ReachabilityCardinality7056776442388479570.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4601154836894218456.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/ReachabilityCardinality4601154836894218456.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :16 after 105
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :105 after 2009
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2009 after 5993
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :5993 after 110173
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :110173 after 165971
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :165971 after 175275
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :175275 after 184741
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :184741 after 194936
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :194936 after 205695
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 34965 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 17:59:38] [INFO ] Flatten gal took : 178 ms
[2024-05-28 17:59:38] [INFO ] Applying decomposition
[2024-05-28 17:59:38] [INFO ] Flatten gal took : 146 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/graph18003857767226139723.txt' '-o' '/tmp/graph18003857767226139723.bin' '-w' '/tmp/graph18003857767226139723.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18003857767226139723.bin' '-l' '-1' '-v' '-w' '/tmp/graph18003857767226139723.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:59:39] [INFO ] Decomposing Gal with order
[2024-05-28 17:59:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:59:39] [INFO ] Removed a total of 2894 redundant transitions.
[2024-05-28 17:59:39] [INFO ] Flatten gal took : 374 ms
[2024-05-28 17:59:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 1500 labels/synchronizations in 69 ms.
[2024-05-28 17:59:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5259100089735886856.gal : 17 ms
[2024-05-28 17:59:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10033148329389461873.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/ReachabilityCardinality5259100089735886856.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10033148329389461873.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10033148329389461873.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 12
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :12 after 14
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :14 after 25
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :25 after 31
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :31 after 2236
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2236 after 2780
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2780 after 3618
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3618 after 163273
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :163273 after 200393
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :200393 after 275577
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :275577 after 432637
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :432637 after 760129
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :760129 after 1.36981e+06
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :1.36981e+06 after 1.95412e+06
BK_STOP 1716919495438
--------------------
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="PolyORBLF-PT-S04J06T08"
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 PolyORBLF-PT-S04J06T08, 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 r290-tajo-171654446800302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J06T08.tgz
mv PolyORBLF-PT-S04J06T08 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 '
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 ;