MCC'2024- Execution of r289-tajo-171654445100053

About the Execution of GreatSPN+red for PhilosophersDyn-PT-10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16205.464	788076.00	971347.00	3972.60	2 4 4 10 2 4 4 2 1 1 1 1 1 1 1 1	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445100053.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 greatspnxred
Input is PhilosophersDyn-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445100053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 26K Apr 11 14:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 11 14:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 219K Apr 11 14:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 14:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 15K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 208K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 814K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 86K Apr 11 15:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 422K Apr 11 15:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 847K Apr 11 15:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.4M Apr 11 15:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K 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 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-00
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-01
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-02
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-03
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-04
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-05
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-06
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-07
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-08
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-09
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-10
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-11
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-12
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-13
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-14
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716842690376

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 20:44:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-27 20:44:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:44:52] [INFO ] Load time of PNML (sax parser for PT used): 327 ms
[2024-05-27 20:44:53] [INFO ] Transformed 170 places.
[2024-05-27 20:44:53] [INFO ] Transformed 2310 transitions.
[2024-05-27 20:44:53] [INFO ] Parsed PT model containing 170 places and 2310 transitions and 18190 arcs in 616 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 64 ms.
Reduction of identical properties reduced properties to check from 16 to 11
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 10, 0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 10, 0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-27 20:44:53] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2024-05-27 20:44:53] [INFO ] Computed 39 invariants in 116 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 10, 0, 0, 0, 0, 1, 0, 0] Max Struct:[10, 10, 10, 10, 1, 1, +inf, 1, 1, +inf, 1]
FORMULA PhilosophersDyn-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (1204 resets) in 299 ms. (33 steps per ms)
FORMULA PhilosophersDyn-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (421 resets) in 113 ms. (438 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 4, 4, 1, 1] Max Struct:[10, 10, 10, +inf, +inf]
[2024-05-27 20:44:53] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
[2024-05-27 20:44:53] [INFO ] Invariant cache hit.
[2024-05-27 20:44:54] [INFO ] [Real]Absence check using 27 positive place invariants in 24 ms returned sat
[2024-05-27 20:44:54] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 40 ms returned sat
[2024-05-27 20:44:55] [INFO ] [Real]Absence check using state equation in 710 ms returned sat
[2024-05-27 20:44:55] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-27 20:44:55] [INFO ] [Real]Added 1030 Read/Feed constraints in 588 ms returned sat
[2024-05-27 20:44:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:44:56] [INFO ] [Nat]Absence check using 27 positive place invariants in 31 ms returned sat
[2024-05-27 20:44:56] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 17 ms returned sat
[2024-05-27 20:44:57] [INFO ] [Nat]Absence check using state equation in 821 ms returned sat
[2024-05-27 20:44:57] [INFO ] [Nat]Added 1030 Read/Feed constraints in 436 ms returned sat
[2024-05-27 20:44:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 642 ms.
[2024-05-27 20:44:58] [INFO ] Added : 0 causal constraints over 0 iterations in 936 ms. Result :sat
Minimization took 605 ms.
[2024-05-27 20:44:59] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2024-05-27 20:44:59] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 6 ms returned sat
[2024-05-27 20:45:00] [INFO ] [Real]Absence check using state equation in 703 ms returned sat
[2024-05-27 20:45:00] [INFO ] [Real]Added 1030 Read/Feed constraints in 610 ms returned sat
[2024-05-27 20:45:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:45:00] [INFO ] [Nat]Absence check using 27 positive place invariants in 16 ms returned sat
[2024-05-27 20:45:00] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 7 ms returned sat
[2024-05-27 20:45:01] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2024-05-27 20:45:02] [INFO ] [Nat]Added 1030 Read/Feed constraints in 496 ms returned sat
[2024-05-27 20:45:02] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 292 ms.
[2024-05-27 20:45:02] [INFO ] Added : 0 causal constraints over 0 iterations in 494 ms. Result :sat
Minimization took 747 ms.
[2024-05-27 20:45:03] [INFO ] [Real]Absence check using 27 positive place invariants in 6 ms returned sat
[2024-05-27 20:45:03] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2024-05-27 20:45:03] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2024-05-27 20:45:04] [INFO ] [Real]Added 1030 Read/Feed constraints in 284 ms returned sat
[2024-05-27 20:45:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:45:04] [INFO ] [Nat]Absence check using 27 positive place invariants in 8 ms returned sat
[2024-05-27 20:45:04] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 5 ms returned sat
[2024-05-27 20:45:05] [INFO ] [Nat]Absence check using state equation in 747 ms returned sat
[2024-05-27 20:45:05] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 20:45:06] [INFO ] [Nat]Added 1030 Read/Feed constraints in 1214 ms returned unknown
[2024-05-27 20:45:06] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2024-05-27 20:45:06] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 6 ms returned sat
[2024-05-27 20:45:07] [INFO ] [Real]Absence check using state equation in 721 ms returned sat
[2024-05-27 20:45:07] [INFO ] [Real]Added 1030 Read/Feed constraints in 209 ms returned sat
[2024-05-27 20:45:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:45:07] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2024-05-27 20:45:07] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 5 ms returned sat
[2024-05-27 20:45:07] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2024-05-27 20:45:08] [INFO ] [Nat]Added 1030 Read/Feed constraints in 220 ms returned sat
[2024-05-27 20:45:08] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 322 ms.
[2024-05-27 20:45:08] [INFO ] Added : 0 causal constraints over 0 iterations in 483 ms. Result :sat
Minimization took 631 ms.
[2024-05-27 20:45:09] [INFO ] [Real]Absence check using 27 positive place invariants in 10 ms returned sat
[2024-05-27 20:45:09] [INFO ] [Real]Absence check using 27 positive and 12 generalized place invariants in 8 ms returned sat
[2024-05-27 20:45:09] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2024-05-27 20:45:10] [INFO ] [Real]Added 1030 Read/Feed constraints in 335 ms returned sat
[2024-05-27 20:45:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:45:10] [INFO ] [Nat]Absence check using 27 positive place invariants in 7 ms returned sat
[2024-05-27 20:45:10] [INFO ] [Nat]Absence check using 27 positive and 12 generalized place invariants in 4 ms returned sat
[2024-05-27 20:45:10] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2024-05-27 20:45:11] [INFO ] [Nat]Added 1030 Read/Feed constraints in 284 ms returned sat
[2024-05-27 20:45:11] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1860 transitions) in 288 ms.
[2024-05-27 20:45:11] [INFO ] Added : 0 causal constraints over 0 iterations in 473 ms. Result :sat
Minimization took 618 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 4, 4, 1, 1] Max Struct:[10, 10, 10, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 4, 4, 1, 1] Max Struct:[10, 10, 10, +inf, +inf]
Support contains 32 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 613 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
Running 2220 sub problems to find dead transitions.
[2024-05-27 20:45:12] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
[2024-05-27 20:45:12] [INFO ] Invariant cache hit.
[2024-05-27 20:45:13] [INFO ] State equation strengthened by 1030 read => feed constraints.
Problem TDEAD16 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1947 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1999 is UNSAT
Problem TDEAD2001 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2025 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2126 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2228 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 27/27 constraints. Problems are: Problem set: 134 solved, 2086 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1761 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1784 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1971 is UNSAT
Problem TDEAD1988 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2008 is UNSAT
Problem TDEAD2010 is UNSAT
Problem TDEAD2032 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2038 is UNSAT
Problem TDEAD2039 is UNSAT
Problem TDEAD2065 is UNSAT
Problem TDEAD2069 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2079 is UNSAT
Problem TDEAD2080 is UNSAT
Problem TDEAD2096 is UNSAT
Problem TDEAD2101 is UNSAT
Problem TDEAD2108 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2163 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2200 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2220 is UNSAT
Problem TDEAD2229 is UNSAT
Problem TDEAD2233 is UNSAT
Problem TDEAD2242 is UNSAT
Problem TDEAD2259 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 12/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
SMT process timed out in 35803ms, After SMT, problems are : Problem set: 380 solved, 1840 unsolved
Search for dead transitions found 380 dead transitions in 35892ms
Found 380 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 113 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36702 ms. Remains : 170/170 places, 1885/2265 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 1885 rows 170 cols
[2024-05-27 20:45:49] [INFO ] Computed 39 invariants in 43 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 4, 4, 1, 1] Max Struct:[10, 10, 10, +inf, +inf]
RANDOM walk for 1000000 steps (119316 resets) in 11104 ms. (90 steps per ms)
BEST_FIRST walk for 5000005 steps (42290 resets) in 6225 ms. (803 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 4, 4, 1, 1] Max Struct:[10, 10, 10, +inf, +inf]
[2024-05-27 20:46:06] [INFO ] Invariant cache hit.
[2024-05-27 20:46:06] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-27 20:46:06] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2024-05-27 20:46:07] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2024-05-27 20:46:07] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:46:08] [INFO ] [Real]Added 1010 Read/Feed constraints in 672 ms returned sat
[2024-05-27 20:46:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:46:08] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-27 20:46:08] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 10 ms returned sat
[2024-05-27 20:46:08] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2024-05-27 20:46:11] [INFO ] [Nat]Added 1010 Read/Feed constraints in 2899 ms returned sat
[2024-05-27 20:46:12] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 224 ms.
[2024-05-27 20:46:12] [INFO ] Added : 0 causal constraints over 0 iterations in 395 ms. Result :sat
Minimization took 6725 ms.
[2024-05-27 20:46:19] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-27 20:46:19] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 12 ms returned sat
[2024-05-27 20:46:19] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2024-05-27 20:46:24] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 20:46:28] [INFO ] [Real]Added 1010 Read/Feed constraints in 9141 ms returned unknown
[2024-05-27 20:46:28] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-27 20:46:28] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 13 ms returned sat
[2024-05-27 20:46:29] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2024-05-27 20:46:29] [INFO ] [Real]Added 1010 Read/Feed constraints in 280 ms returned sat
[2024-05-27 20:46:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:46:29] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-27 20:46:29] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 11 ms returned sat
[2024-05-27 20:46:30] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2024-05-27 20:46:34] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 20:46:39] [INFO ] [Nat]Added 1010 Read/Feed constraints in 9128 ms returned unknown
[2024-05-27 20:46:39] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-27 20:46:39] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 20 ms returned sat
[2024-05-27 20:46:40] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2024-05-27 20:46:43] [INFO ] [Real]Added 1010 Read/Feed constraints in 3750 ms returned sat
[2024-05-27 20:46:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:46:43] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-27 20:46:43] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 7 ms returned sat
[2024-05-27 20:46:44] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2024-05-27 20:46:45] [INFO ] [Nat]Added 1010 Read/Feed constraints in 1411 ms returned sat
[2024-05-27 20:46:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 233 ms.
[2024-05-27 20:46:46] [INFO ] Added : 0 causal constraints over 0 iterations in 419 ms. Result :sat
Minimization took 5134 ms.
[2024-05-27 20:46:51] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-27 20:46:51] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 22 ms returned sat
[2024-05-27 20:46:52] [INFO ] [Real]Absence check using state equation in 914 ms returned sat
[2024-05-27 20:46:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:46:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-27 20:46:52] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 11 ms returned sat
[2024-05-27 20:46:53] [INFO ] [Nat]Absence check using state equation in 542 ms returned sat
[2024-05-27 20:46:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 20:46:59] [INFO ] [Nat]Added 1010 Read/Feed constraints in 6060 ms returned sat
[2024-05-27 20:46:59] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 295 ms.
[2024-05-27 20:46:59] [INFO ] Added : 0 causal constraints over 0 iterations in 500 ms. Result :sat
Minimization took 5224 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 4, 4, 1, 1] Max Struct:[10, 10, 10, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 4, 4, 1, 1] Max Struct:[10, 10, 10, +inf, +inf]
Support contains 32 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 215 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 129 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2024-05-27 20:47:05] [INFO ] Invariant cache hit.
[2024-05-27 20:47:06] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-27 20:47:06] [INFO ] Invariant cache hit.
[2024-05-27 20:47:06] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:47:44] [INFO ] Performed 6/170 implicitness test of which 0 returned IMPLICIT in 37 seconds.
[2024-05-27 20:48:27] [INFO ] Performed 15/170 implicitness test of which 0 returned IMPLICIT in 79 seconds.
[2024-05-27 20:48:57] [INFO ] Performed 119/170 implicitness test of which 0 returned IMPLICIT in 109 seconds.
[2024-05-27 20:48:59] [INFO ] Implicit Places using invariants and state equation in 113136 ms returned []
Implicit Place search using SMT with State Equation took 113544 ms to find 0 implicit places.
[2024-05-27 20:48:59] [INFO ] Redundant transitions in 177 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:48:59] [INFO ] Invariant cache hit.
[2024-05-27 20:48:59] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 42621ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 42650ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156523 ms. Remains : 170/170 places, 1885/1885 transitions.
When looking for a positive semi flow solution, solver replied unsat
RANDOM walk for 40000 steps (4779 resets) in 2094 ms. (19 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (394 resets) in 231 ms. (172 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (388 resets) in 196 ms. (203 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (281 resets) in 147 ms. (270 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (282 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (282 resets) in 143 ms. (277 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (282 resets) in 145 ms. (274 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (369 resets) in 162 ms. (245 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (369 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 163652 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 8
Probabilistic random walk after 163652 steps, saw 42367 distinct states, run finished after 3013 ms. (steps per millisecond=54 ) properties seen :0
[2024-05-27 20:49:46] [INFO ] Invariant cache hit.
[2024-05-27 20:49:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 15/47 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 28/75 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 9/84 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 78/162 variables, 26/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1885/2047 variables, 162/201 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2047 variables, 1010/1211 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2047 variables, 0/1211 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 15/47 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 28/75 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 9/84 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 78/162 variables, 26/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1885/2047 variables, 162/201 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2047 variables, 1010/1211 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2047 variables, 4/1215 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2047 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1223 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 10120ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 176 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:49:57] [INFO ] Invariant cache hit.
[2024-05-27 20:49:57] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 32403ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 32434ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32620 ms. Remains : 170/170 places, 1885/1885 transitions.
RANDOM walk for 40000 steps (4765 resets) in 731 ms. (54 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (391 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (385 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (280 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (280 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (282 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (282 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (364 resets) in 77 ms. (512 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (364 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 158876 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 8
Probabilistic random walk after 158876 steps, saw 41286 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
[2024-05-27 20:50:32] [INFO ] Invariant cache hit.
[2024-05-27 20:50:32] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 15/47 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 28/75 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 9/84 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 78/162 variables, 26/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1885/2047 variables, 162/201 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2047 variables, 1010/1211 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2047 variables, 0/1211 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 8/2055 variables, 8/1219 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 8 unsolved in 24875 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 15/47 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 28/75 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 9/84 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 78/162 variables, 26/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1885/2047 variables, 162/201 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2047 variables, 1010/1211 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2047 variables, 4/1215 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2047 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 8/2055 variables, 8/1223 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2055 variables, 4/1227 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2055 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/2055 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2055/2055 variables, and 1227 constraints, problems are : Problem set: 0 solved, 8 unsolved in 45023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 69945ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 192 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 136 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2024-05-27 20:51:43] [INFO ] Invariant cache hit.
[2024-05-27 20:51:43] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-27 20:51:43] [INFO ] Invariant cache hit.
[2024-05-27 20:51:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:52:20] [INFO ] Performed 5/170 implicitness test of which 0 returned IMPLICIT in 35 seconds.
[2024-05-27 20:52:45] [INFO ] Implicit Places using invariants and state equation in 61450 ms returned []
Implicit Place search using SMT with State Equation took 61857 ms to find 0 implicit places.
[2024-05-27 20:52:45] [INFO ] Redundant transitions in 151 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:52:45] [INFO ] Invariant cache hit.
[2024-05-27 20:52:45] [INFO ] State equation strengthened by 1010 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 2.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 41660ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 41690ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103857 ms. Remains : 170/170 places, 1885/1885 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2, 4, 4, 1, 1] Max Struct:[10, 10, 10, +inf, +inf]
Starting property specific reduction for PhilosophersDyn-PT-10-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
[2024-05-27 20:53:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PhilosophersDyn-PT-10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 170
TRANSITIONS: 2310
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.127s, Sys 0.016s]

SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.021s, Sys 0.000s]

----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 751
MODEL NAME: /home/mcc/execution/model
170 places, 2310 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA PhilosophersDyn-PT-10-UpperBounds-00 2 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-PT-10-UpperBounds-01 4 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-PT-10-UpperBounds-02 4 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-PT-10-UpperBounds-03 10 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-PT-10-UpperBounds-04 2 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-PT-10-UpperBounds-05 4 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-PT-10-UpperBounds-06 4 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-PT-10-UpperBounds-07 2 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-PT-10-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-PT-10-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-PT-10-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-PT-10-UpperBounds-11 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-PT-10-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-PT-10-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-PT-10-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-PT-10-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716843478452

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="PhilosophersDyn-PT-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PhilosophersDyn-PT-10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445100053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-10.tgz
mv PhilosophersDyn-PT-10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;