Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446800294.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-S04J06T06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446800294
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 19K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:07 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 8.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Apr 11 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Apr 11 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 90K Apr 11 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 427K Apr 11 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K Apr 23 07:43 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 2.6M 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-S04J06T06-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716918399333

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-S04J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-28 17:46:40] [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:46:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:46:41] [INFO ] Load time of PNML (sax parser for PT used): 266 ms
[2024-05-28 17:46:41] [INFO ] Transformed 618 places.
[2024-05-28 17:46:41] [INFO ] Transformed 3190 transitions.
[2024-05-28 17:46:41] [INFO ] Parsed PT model containing 618 places and 3190 transitions and 21570 arcs in 464 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 1626 transitions
Reduce redundant transitions removed 1626 transitions.
[2024-05-28 17:46:41] [INFO ] Flatten gal took : 335 ms
RANDOM walk for 40000 steps (8 resets) in 2724 ms. (14 steps per ms) remains 11/16 properties
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 17:46:42] [INFO ] Flatten gal took : 139 ms
[2024-05-28 17:46:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16953226134655296081.gal : 73 ms
[2024-05-28 17:46:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2860887266720528372.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16953226134655296081.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2860887266720528372.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (8 resets) in 1326 ms. (30 steps per ms) remains 11/11 properties
Loading property file /tmp/ReachabilityCardinality2860887266720528372.prop.
BEST_FIRST walk for 40002 steps (8 resets) in 690 ms. (57 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1047 ms. (38 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 523 ms. (76 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 330 ms. (120 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :7 after 13
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :13 after 15
SDD proceeding with computation,11 properties remain. new max is 128
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 11/11 properties
SDD size :15 after 28
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :28 after 119
BEST_FIRST walk for 40003 steps (8 resets) in 177 ms. (224 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 278 ms. (143 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 190 ms. (209 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :119 after 2723
BEST_FIRST walk for 40002 steps (8 resets) in 247 ms. (161 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :2723 after 3618
BEST_FIRST walk for 40003 steps (8 resets) in 272 ms. (146 steps per ms) remains 11/11 properties
[2024-05-28 17:46:43] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
// Phase 1: matrix 1540 rows 618 cols
[2024-05-28 17:46:43] [INFO ] Computed 54 invariants in 72 ms
[2024-05-28 17:46:43] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-06 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-07 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 55/558 variables, 8/26 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 4/30 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-00 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-04 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-05 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-09 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-12 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 60/618 variables, 24/54 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/618 variables, 0/54 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1540/2158 variables, 618/672 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2158 variables, 120/792 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2158 variables, 0/792 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/2158 variables, 0/792 constraints. Problems are: Problem set: 7 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2158/2158 variables, and 792 constraints, problems are : Problem set: 7 solved, 4 unsolved in 5065 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 618/618 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 11/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 192/234 variables, 8/8 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/8 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 21/255 variables, 6/14 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 345/600 variables, 27/41 constraints. Problems are: Problem set: 7 solved, 4 unsolved
[2024-05-28 17:46:49] [INFO ] Deduced a trap composed of 84 places in 168 ms of which 26 ms to minimize.
[2024-05-28 17:46:50] [INFO ] Deduced a trap composed of 84 places in 143 ms of which 5 ms to minimize.
[2024-05-28 17:46:50] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:46:50] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 1 ms to minimize.
[2024-05-28 17:46:50] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 1 ms to minimize.
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-11 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 5/46 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 0/46 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/606 variables, 3/49 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 0/49 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 10/616 variables, 9/58 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/616 variables, 0/58 constraints. Problems are: Problem set: 8 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2156/2158 variables, and 674 constraints, problems are : Problem set: 8 solved, 3 unsolved in 4844 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 616/618 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 5/5 constraints]
After SMT, in 10461ms problems are : Problem set: 8 solved, 3 unsolved
Parikh walk visited 0 properties in 1288 ms.
Support contains 13 out of 618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 614 transition count 1513
Reduce places removed 51 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 563 transition count 1511
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 110 place count 561 transition count 1511
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 110 place count 561 transition count 1440
Deduced a syphon composed of 71 places in 3 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 252 place count 490 transition count 1440
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 354 place count 439 transition count 1389
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 364 place count 439 transition count 1379
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 374 place count 429 transition count 1379
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 375 place count 429 transition count 1379
Applied a total of 375 rules in 351 ms. Remains 429 /618 variables (removed 189) and now considering 1379/1564 (removed 185) transitions.
Running 1375 sub problems to find dead transitions.
[2024-05-28 17:46:55] [INFO ] Flow matrix only has 1355 transitions (discarded 24 similar events)
// Phase 1: matrix 1355 rows 429 cols
[2024-05-28 17:46:55] [INFO ] Computed 50 invariants in 47 ms
[2024-05-28 17:46:55] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :3618 after 162411
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :162411 after 173413
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :173413 after 280285
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :280285 after 432505
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
[2024-05-28 17:47:11] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 2 ms to minimize.
[2024-05-28 17:47:11] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-05-28 17:47:11] [INFO ] Deduced a trap composed of 34 places in 235 ms of which 3 ms to minimize.
[2024-05-28 17:47:11] [INFO ] Deduced a trap composed of 56 places in 227 ms of which 3 ms to minimize.
[2024-05-28 17:47:12] [INFO ] Deduced a trap composed of 55 places in 243 ms of which 6 ms to minimize.
[2024-05-28 17:47:13] [INFO ] Deduced a trap composed of 141 places in 187 ms of which 2 ms to minimize.
[2024-05-28 17:47:13] [INFO ] Deduced a trap composed of 135 places in 205 ms of which 2 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 32768
SDD size :432505 after 499865
[2024-05-28 17:47:15] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 2 ms to minimize.
[2024-05-28 17:47:15] [INFO ] Deduced a trap composed of 63 places in 174 ms of which 2 ms to minimize.
[2024-05-28 17:47:19] [INFO ] Deduced a trap composed of 134 places in 304 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 425/1784 variables, and 55 constraints, problems are : Problem set: 0 solved, 1375 unsolved in 20109 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 28/33 constraints, State Equation: 0/429 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1375/1375 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
[2024-05-28 17:47:27] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:47:27] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 0 ms to minimize.
[2024-05-28 17:47:27] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:47:27] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 0 ms to minimize.
[2024-05-28 17:47:27] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 2 ms to minimize.
[2024-05-28 17:47:28] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-05-28 17:47:30] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/1784 variables, and 62 constraints, problems are : Problem set: 0 solved, 1375 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 28/33 constraints, State Equation: 0/429 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1375 constraints, Known Traps: 17/17 constraints]
After SMT, in 47347ms problems are : Problem set: 0 solved, 1375 unsolved
Search for dead transitions found 0 dead transitions in 47373ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47751 ms. Remains : 429/618 places, 1379/1564 transitions.
RANDOM walk for 40000 steps (11 resets) in 853 ms. (46 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 232 ms. (171 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (9 resets) in 325 ms. (122 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (9 resets) in 255 ms. (156 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 64462 steps, run timeout after 3012 ms. (steps per millisecond=21 ) properties seen :0 out of 3
Probabilistic random walk after 64462 steps, saw 46531 distinct states, run finished after 3018 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-28 17:47:46] [INFO ] Flow matrix only has 1355 transitions (discarded 24 similar events)
[2024-05-28 17:47:46] [INFO ] Invariant cache hit.
[2024-05-28 17:47:46] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/63 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 323/386 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 16/402 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 25/427 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1355/1782 variables, 427/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1782 variables, 120/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1782 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/1784 variables, 2/598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1784 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1784 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1784 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1784/1784 variables, and 599 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4896 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 429/429 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/63 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 323/386 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 16/402 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 25/427 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 17:47:52] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 1 ms to minimize.
[2024-05-28 17:47:52] [INFO ] Deduced a trap composed of 51 places in 39 ms of which 1 ms to minimize.
[2024-05-28 17:47:52] [INFO ] Deduced a trap composed of 53 places in 35 ms of which 1 ms to minimize.
[2024-05-28 17:47:52] [INFO ] Deduced a trap composed of 53 places in 32 ms of which 1 ms to minimize.
[2024-05-28 17:47:52] [INFO ] Deduced a trap composed of 52 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1782/1784 variables, and 481 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 427/429 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 49980ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 1379/1379 transitions.
Applied a total of 0 rules in 60 ms. Remains 429 /429 variables (removed 0) and now considering 1379/1379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 429/429 places, 1379/1379 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 1379/1379 transitions.
Applied a total of 0 rules in 55 ms. Remains 429 /429 variables (removed 0) and now considering 1379/1379 (removed 0) transitions.
[2024-05-28 17:48:37] [INFO ] Flow matrix only has 1355 transitions (discarded 24 similar events)
[2024-05-28 17:48:37] [INFO ] Invariant cache hit.
[2024-05-28 17:48:38] [INFO ] Implicit Places using invariants in 1309 ms returned [97, 139, 230, 253, 336, 384]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1320 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 423/429 places, 1379/1379 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 420 transition count 1376
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 420 transition count 1376
Applied a total of 6 rules in 49 ms. Remains 420 /423 variables (removed 3) and now considering 1376/1379 (removed 3) transitions.
[2024-05-28 17:48:38] [INFO ] Flow matrix only has 1352 transitions (discarded 24 similar events)
// Phase 1: matrix 1352 rows 420 cols
[2024-05-28 17:48:38] [INFO ] Computed 44 invariants in 21 ms
[2024-05-28 17:48:38] [INFO ] Implicit Places using invariants in 485 ms returned []
[2024-05-28 17:48:38] [INFO ] Flow matrix only has 1352 transitions (discarded 24 similar events)
[2024-05-28 17:48:38] [INFO ] Invariant cache hit.
[2024-05-28 17:48:39] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:48:45] [INFO ] Implicit Places using invariants and state equation in 6759 ms returned []
Implicit Place search using SMT with State Equation took 7259 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 420/429 places, 1376/1379 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8686 ms. Remains : 420/429 places, 1376/1379 transitions.
RANDOM walk for 40000 steps (11 resets) in 729 ms. (54 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 208 ms. (191 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 173 ms. (229 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 123448 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 3
Probabilistic random walk after 123448 steps, saw 86535 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
[2024-05-28 17:48:49] [INFO ] Flow matrix only has 1352 transitions (discarded 24 similar events)
[2024-05-28 17:48:49] [INFO ] Invariant cache hit.
[2024-05-28 17:48:49] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 64/77 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/85 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 306/391 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 12/403 variables, 12/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 15/418 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1352/1770 variables, 418/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1770 variables, 120/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1770 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/1772 variables, 2/583 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1772 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1772 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1772 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1772/1772 variables, and 584 constraints, problems are : Problem set: 0 solved, 3 unsolved in 9567 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 420/420 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 64/77 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/85 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 306/391 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 12/403 variables, 12/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 15/418 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 17:48:59] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2024-05-28 17:48:59] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
[2024-05-28 17:48:59] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1352/1770 variables, 418/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1770 variables, 120/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1770 variables, 3/587 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 17:49:11] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 1 ms to minimize.
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-10 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-28 17:49:11] [INFO ] Deduced a trap composed of 188 places in 326 ms of which 2 ms to minimize.
[2024-05-28 17:49:12] [INFO ] Deduced a trap composed of 182 places in 329 ms of which 3 ms to minimize.
[2024-05-28 17:49:12] [INFO ] Deduced a trap composed of 182 places in 365 ms of which 6 ms to minimize.
[2024-05-28 17:49:13] [INFO ] Deduced a trap composed of 27 places in 256 ms of which 2 ms to minimize.
[2024-05-28 17:49:13] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1770 variables, 6/593 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1770 variables, 0/593 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1772 variables, 2/595 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1772 variables, 1/596 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1772 variables, 0/596 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1772 variables, 0/596 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1772/1772 variables, and 596 constraints, problems are : Problem set: 1 solved, 2 unsolved in 21194 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 420/420 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 30791ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 2182 ms.
Support contains 12 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1376/1376 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 418 transition count 1374
Applied a total of 4 rules in 37 ms. Remains 418 /420 variables (removed 2) and now considering 1374/1376 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 418/420 places, 1374/1376 transitions.
RANDOM walk for 40000 steps (12 resets) in 574 ms. (69 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (9 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
SDD proceeding with computation,11 properties remain. new max is 65536
SDD size :499865 after 2.02369e+06
Interrupted probabilistic random walk after 156331 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 2
Probabilistic random walk after 156331 steps, saw 107781 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
[2024-05-28 17:49:25] [INFO ] Flow matrix only has 1350 transitions (discarded 24 similar events)
// Phase 1: matrix 1350 rows 418 cols
[2024-05-28 17:49:25] [INFO ] Computed 44 invariants in 30 ms
[2024-05-28 17:49:25] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 171/183 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 45/228 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/240 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 163/403 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/408 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8/416 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1350/1766 variables, 416/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1766 variables, 120/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1766 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/1768 variables, 2/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1768 variables, 1/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1768 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1768 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1768/1768 variables, and 582 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1381 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 418/418 constraints, ReadFeed: 120/120 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 171/183 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 45/228 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/240 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 163/403 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/408 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8/416 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:49:27] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 2 ms to minimize.
[2024-05-28 17:49:27] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-05-28 17:49:27] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:49:27] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1350/1766 variables, 416/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1766 variables, 120/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1766 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1766 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/1768 variables, 2/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1768 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1768 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1768 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1768/1768 variables, and 588 constraints, problems are : Problem set: 0 solved, 2 unsolved in 85305 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 418/418 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 86745ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1119 ms.
Support contains 12 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 1374/1374 transitions.
Applied a total of 0 rules in 30 ms. Remains 418 /418 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 418/418 places, 1374/1374 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 1374/1374 transitions.
Applied a total of 0 rules in 30 ms. Remains 418 /418 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
[2024-05-28 17:50:53] [INFO ] Flow matrix only has 1350 transitions (discarded 24 similar events)
[2024-05-28 17:50:53] [INFO ] Invariant cache hit.
[2024-05-28 17:50:54] [INFO ] Implicit Places using invariants in 666 ms returned []
[2024-05-28 17:50:54] [INFO ] Flow matrix only has 1350 transitions (discarded 24 similar events)
[2024-05-28 17:50:54] [INFO ] Invariant cache hit.
[2024-05-28 17:50:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:51:01] [INFO ] Implicit Places using invariants and state equation in 7773 ms returned []
Implicit Place search using SMT with State Equation took 8442 ms to find 0 implicit places.
[2024-05-28 17:51:01] [INFO ] Redundant transitions in 103 ms returned []
Running 1370 sub problems to find dead transitions.
[2024-05-28 17:51:01] [INFO ] Flow matrix only has 1350 transitions (discarded 24 similar events)
[2024-05-28 17:51:01] [INFO ] Invariant cache hit.
[2024-05-28 17:51:01] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-28 17:51:15] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 2 ms to minimize.
[2024-05-28 17:51:16] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 2 ms to minimize.
[2024-05-28 17:51:16] [INFO ] Deduced a trap composed of 52 places in 36 ms of which 1 ms to minimize.
[2024-05-28 17:51:16] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:51:16] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2024-05-28 17:51:16] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 1 ms to minimize.
[2024-05-28 17:51:16] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 1 ms to minimize.
[2024-05-28 17:51:16] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 0 ms to minimize.
[2024-05-28 17:51:16] [INFO ] Deduced a trap composed of 59 places in 272 ms of which 2 ms to minimize.
[2024-05-28 17:51:17] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 2 ms to minimize.
[2024-05-28 17:51:17] [INFO ] Deduced a trap composed of 37 places in 289 ms of which 4 ms to minimize.
[2024-05-28 17:51:18] [INFO ] Deduced a trap composed of 139 places in 326 ms of which 3 ms to minimize.
[2024-05-28 17:51:19] [INFO ] Deduced a trap composed of 133 places in 310 ms of which 3 ms to minimize.
[2024-05-28 17:51:22] [INFO ] Deduced a trap composed of 220 places in 307 ms of which 3 ms to minimize.
[2024-05-28 17:51:23] [INFO ] Deduced a trap composed of 238 places in 287 ms of which 3 ms to minimize.
[2024-05-28 17:51:23] [INFO ] Deduced a trap composed of 215 places in 332 ms of which 14 ms to minimize.
[2024-05-28 17:51:25] [INFO ] Deduced a trap composed of 158 places in 308 ms of which 3 ms to minimize.
[2024-05-28 17:51:25] [INFO ] Deduced a trap composed of 142 places in 267 ms of which 3 ms to minimize.
[2024-05-28 17:51:25] [INFO ] Deduced a trap composed of 156 places in 261 ms of which 3 ms to minimize.
[2024-05-28 17:51:26] [INFO ] Deduced a trap composed of 228 places in 363 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-28 17:51:33] [INFO ] Deduced a trap composed of 154 places in 253 ms of which 3 ms to minimize.
[2024-05-28 17:51:34] [INFO ] Deduced a trap composed of 205 places in 364 ms of which 3 ms to minimize.
[2024-05-28 17:51:34] [INFO ] Deduced a trap composed of 207 places in 318 ms of which 3 ms to minimize.
[2024-05-28 17:51:35] [INFO ] Deduced a trap composed of 215 places in 367 ms of which 4 ms to minimize.
[2024-05-28 17:51:35] [INFO ] Deduced a trap composed of 206 places in 337 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/1768 variables, and 65 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 25/65 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-05-28 17:51:49] [INFO ] Deduced a trap composed of 198 places in 397 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/1768 variables, and 66 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 26/26 constraints]
After SMT, in 66586ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 66602ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75192 ms. Remains : 418/418 places, 1374/1374 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 418 transition count 1350
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 36 place count 412 transition count 1398
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 1 with 42 rules applied. Total rules applied 78 place count 412 transition count 1356
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 412 transition count 1350
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 90 place count 406 transition count 1350
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 96 place count 406 transition count 1344
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 102 place count 400 transition count 1344
Applied a total of 102 rules in 150 ms. Remains 400 /418 variables (removed 18) and now considering 1344/1374 (removed 30) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1344 rows 400 cols
[2024-05-28 17:52:08] [INFO ] Computed 44 invariants in 24 ms
[2024-05-28 17:52:08] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 17:52:08] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-28 17:52:08] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 33 ms returned sat
[2024-05-28 17:52:10] [INFO ] After 1744ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-28 17:52:11] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 1 ms to minimize.
[2024-05-28 17:52:11] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:52:11] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:52:11] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:52:12] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:52:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1332 ms
TRAPS : Iteration 1
[2024-05-28 17:52:13] [INFO ] After 4769ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-28 17:52:14] [INFO ] After 5401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-28 17:52:14] [INFO ] Flatten gal took : 117 ms
[2024-05-28 17:52:14] [INFO ] Flatten gal took : 101 ms
[2024-05-28 17:52:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13753455445667499931.gal : 24 ms
[2024-05-28 17:52:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3522845088089665029.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/ReachabilityCardinality13753455445667499931.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3522845088089665029.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/ReachabilityCardinality3522845088089665029.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 366
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :366 after 2401
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2401 after 2758
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2758 after 3409
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3409 after 3702
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3702 after 3783
SDD proceeding with computation,11 properties remain. new max is 131072
SDD size :2.02369e+06 after 1.02519e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3783 after 136917
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :136917 after 142274
Detected timeout of ITS tools.
[2024-05-28 17:52:29] [INFO ] Flatten gal took : 64 ms
[2024-05-28 17:52:29] [INFO ] Applying decomposition
[2024-05-28 17:52:29] [INFO ] Flatten gal took : 65 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/graph6343341632171776306.txt' '-o' '/tmp/graph6343341632171776306.bin' '-w' '/tmp/graph6343341632171776306.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6343341632171776306.bin' '-l' '-1' '-v' '-w' '/tmp/graph6343341632171776306.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:52:30] [INFO ] Decomposing Gal with order
[2024-05-28 17:52:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:52:30] [INFO ] Removed a total of 747 redundant transitions.
[2024-05-28 17:52:30] [INFO ] Flatten gal took : 512 ms
[2024-05-28 17:52:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 445 labels/synchronizations in 71 ms.
[2024-05-28 17:52:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9663122540311541121.gal : 24 ms
[2024-05-28 17:52:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality219571034486072344.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/ReachabilityCardinality9663122540311541121.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality219571034486072344.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 ...327
Loading property file /tmp/ReachabilityCardinality219571034486072344.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :16 after 517
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :517 after 931
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :931 after 1061
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1061 after 1247
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1247 after 2263
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 37527 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 17:52:46] [INFO ] Flatten gal took : 99 ms
[2024-05-28 17:52:46] [INFO ] Applying decomposition
[2024-05-28 17:52:46] [INFO ] Flatten gal took : 101 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/graph1837759329871396831.txt' '-o' '/tmp/graph1837759329871396831.bin' '-w' '/tmp/graph1837759329871396831.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1837759329871396831.bin' '-l' '-1' '-v' '-w' '/tmp/graph1837759329871396831.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:52:46] [INFO ] Decomposing Gal with order
[2024-05-28 17:52:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:52:46] [INFO ] Removed a total of 940 redundant transitions.
[2024-05-28 17:52:46] [INFO ] Flatten gal took : 174 ms
[2024-05-28 17:52:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 235 labels/synchronizations in 22 ms.
[2024-05-28 17:52:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11842208020518924431.gal : 13 ms
[2024-05-28 17:52:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality537707073678415858.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/ReachabilityCardinality11842208020518924431.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality537707073678415858.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/ReachabilityCardinality537707073678415858.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 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 12
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :12 after 13
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :13 after 14
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :14 after 15
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :15 after 25
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :25 after 29
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :29 after 76387
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :76387 after 229147
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :229147 after 6.19804e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :6.19804e+06 after 2.69181e+07
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.69181e+07 after 4.82166e+07
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :4.82166e+07 after 7.91557e+07
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :7.91557e+07 after 8.30839e+07
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :8.30839e+07 after 1.39203e+08

BK_STOP 1716919200809

--------------------
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-S04J06T06"
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-S04J06T06, 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-171654446800294"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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