Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r201-smll-171649586600135.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is HirschbergSinclair-PT-50, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-171649586600135
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 02:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 13 02:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 02:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 13 02:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 652K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716643452957

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 13:24:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 13:24:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 13:24:15] [INFO ] Load time of PNML (sax parser for PT used): 290 ms
[2024-05-25 13:24:15] [INFO ] Transformed 1208 places.
[2024-05-25 13:24:16] [INFO ] Transformed 1102 transitions.
[2024-05-25 13:24:16] [INFO ] Parsed PT model containing 1208 places and 1102 transitions and 3361 arcs in 551 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 51 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (36 resets) in 2972 ms. (13 steps per ms) remains 8/16 properties
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 885 ms. (45 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 468 ms. (85 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 520 ms. (76 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 726 ms. (55 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 559 ms. (71 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 8/8 properties
// Phase 1: matrix 1102 rows 1208 cols
[2024-05-25 13:24:18] [INFO ] Computed 106 invariants in 69 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem HirschbergSinclair-PT-50-ReachabilityFireability-2024-08 is UNSAT
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-50-ReachabilityFireability-2024-10 is UNSAT
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 874/1011 variables, 70/70 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1011 variables, 0/70 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 90/1101 variables, 30/100 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1101 variables, 0/100 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 60/1161 variables, 6/106 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1161 variables, 0/106 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1102/2263 variables, 1161/1267 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2263 variables, 0/1267 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 47/2310 variables, 47/1314 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2310/2310 variables, and 1314 constraints, problems are : Problem set: 2 solved, 6 unsolved in 5073 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 1208/1208 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 890/997 variables, 66/66 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-25 13:24:25] [INFO ] Deduced a trap composed of 19 places in 842 ms of which 108 ms to minimize.
[2024-05-25 13:24:26] [INFO ] Deduced a trap composed of 40 places in 689 ms of which 9 ms to minimize.
[2024-05-25 13:24:27] [INFO ] Deduced a trap composed of 38 places in 623 ms of which 9 ms to minimize.
[2024-05-25 13:24:27] [INFO ] Deduced a trap composed of 65 places in 622 ms of which 11 ms to minimize.
[2024-05-25 13:24:28] [INFO ] Deduced a trap composed of 28 places in 612 ms of which 11 ms to minimize.
[2024-05-25 13:24:29] [INFO ] Deduced a trap composed of 59 places in 641 ms of which 10 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 1)
(s71 0)
(s72 0)
(s73 1)
(s74 1)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s103 0)
(s105 0)
(s106 1)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s112 0)
(s114 1)
(s116 0)
(s119 1)
(s121 0)
(s123 0)
(s126 0)
(s128 0)
(s130 1)
(s133 1)
(s135 0)
(s137 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 1)
(s145 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s161 0)
(s163 1)
(s165 0)
(s168 0)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 0)
(s175 0)
(s177 1)
(s179 0)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s189 0)
(s191 0)
(s193 1)
(s196 1)
(s198 0)
(s200 0)
(s203 0)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s210 0)
(s212 0)
(s214 1)
(s217 0)
(s219 0)
(s221 1)
(s224 1)
(s226 0)
(s228 0)
(s231 1)
(s233 0)
(s235 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s245 1)
(s247 1)
(s249 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s259 0)
(s260 0)
(s261 0)
(s262 1)
(s263 0)
(s264 0)
(s265 1)
(s266 0)
(s268 0)
(s270 0)
(s273 0)
(s275 0)
(s277 1)
(s280 0)
(s282 0)
(s284 1)
(s287 1)
(s288 1)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s294 0)
(s296 0)
(s298 0)
(s301 0)
(s303 0)
(s305 0)
(s308 0)
(s310 1)
(s312 0)
(s315 1)
(s317 0)
(s319 0)
(s322 0)
(s324 0)
(s326 1)
(s328 0)
(s329 1)
(s330 0)
(s331 0)
(s332 1)
(s333 0)
(s334 0)
(s336 0)
(s338 0)
(s340 0)
(s343 0)
(s345 0)
(s347 0)
(s350 0)
(s352 0)
(s354 0)
(s357 0)
(s359 0)
(s361 0)
(s364 1)
(s366 0)
(s368 0)
(s371 0)
(s373 0)
(s375 0)
(s378 0)
(s380 0)
(s382 0)
(s385 0)
(s387 0)
(s389 0)
(s392 0)
(s394 1)
(s396 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 1)
(s406 0)
(s408 0)
(s410 0)
(s413 0)
(s414 0)
(s415 1)
(s416 0)
(s417 0)
(s418 0)
(s420 0)
(s422 0)
(s424 0)
(s427 0)
(s429 0)
(s431 0)
(s434 0)
(s436 0)
(s438 0)
(s441 0)
(s443 0)
(s445 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s455 0)
(s457 0)
(s459 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s471 0)
(s473 0)
(s474 1)
(s475 0)
(s477 1)
(s479 0)
(s481 0)
(s483 0)
(s484 0)
(s485 1)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s505 0)
(s507 0)
(s509 0)
(s511 0)
(s513 0)
(s515 0)
(s516 1)
(s517 1)
(s519 0)
(s521 0)
(s523 0)
(s524 0)
(s525 0)
(s527 0)
(s529 0)
(s531 0)
(s532 1)
(s533 0)
(s535 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s571 0)
(s573 0)
(s575 0)
(s577 0)
(s579 0)
(s581 0)
(s583 0)
(s584 0)
(s585 0)
(s587 0)
(s589 0)
(s591 0)
(s593 0)
(s595 0)
(s597 0)
(s599 0)
(s601 0)
(s603 0)
(s605 0)
(s607 0)
(s609 0)
(s611 0)
(s613 1)
(s615 0)
(s617 0)
(s619 0)
(s621 0)
(s623 0)
(s625 0)
(s627 0)
(s629 0)
(s631 0)
(s633 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 0)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/2310 variables, and 72 constraints, problems are : Problem set: 2 solved, 6 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 66/100 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/1208 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 6/6 constraints]
After SMT, in 10574ms problems are : Problem set: 2 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 107 out of 1208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1208/1208 places, 1102/1102 transitions.
Graph (complete) has 2314 edges and 1208 vertex of which 1158 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.9 ms
Discarding 50 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 195 rules applied. Total rules applied 196 place count 1158 transition count 907
Reduce places removed 195 places and 0 transitions.
Graph (complete) has 1734 edges and 963 vertex of which 911 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.4 ms
Discarding 52 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 196 rules applied. Total rules applied 392 place count 911 transition count 907
Drop transitions (Empty/Sink Transition effects.) removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 2 with 52 rules applied. Total rules applied 444 place count 911 transition count 855
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 477 place count 878 transition count 822
Iterating global reduction 3 with 33 rules applied. Total rules applied 510 place count 878 transition count 822
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 537 place count 851 transition count 795
Iterating global reduction 3 with 27 rules applied. Total rules applied 564 place count 851 transition count 795
Free-agglomeration rule (complex) applied 34 times.
Iterating global reduction 3 with 34 rules applied. Total rules applied 598 place count 851 transition count 761
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 632 place count 817 transition count 761
Reduce places removed 19 places and 19 transitions.
Iterating global reduction 4 with 19 rules applied. Total rules applied 651 place count 798 transition count 742
Applied a total of 651 rules in 747 ms. Remains 798 /1208 variables (removed 410) and now considering 742/1102 (removed 360) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 765 ms. Remains : 798/1208 places, 742/1102 transitions.
RANDOM walk for 40000 steps (48 resets) in 811 ms. (49 steps per ms) remains 5/6 properties
FORMULA HirschbergSinclair-PT-50-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
// Phase 1: matrix 742 rows 798 cols
[2024-05-25 13:24:30] [INFO ] Computed 56 invariants in 9 ms
[2024-05-25 13:24:30] [INFO ] State equation strengthened by 34 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 660/728 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 5/733 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/733 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 732/1465 variables, 733/789 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1465 variables, 31/820 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1465 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 75/1540 variables, 65/885 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1540 variables, 3/888 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1540 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1540/1540 variables, and 888 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5857 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 798/798 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 660/728 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 5/733 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/733 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 732/1465 variables, 733/789 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1465 variables, 31/820 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1465 variables, 1/821 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1465 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 75/1540 variables, 65/886 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 3/889 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1540 variables, 4/893 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1540 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1540 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1540/1540 variables, and 893 constraints, problems are : Problem set: 0 solved, 5 unsolved in 8787 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 798/798 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 14739ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 3916 ms.
Support contains 68 out of 798 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 798/798 places, 742/742 transitions.
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 51 rules applied. Total rules applied 51 place count 798 transition count 691
Reduce places removed 51 places and 0 transitions.
Graph (complete) has 1383 edges and 747 vertex of which 740 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 52 rules applied. Total rules applied 103 place count 740 transition count 691
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 110 place count 740 transition count 684
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 115 place count 735 transition count 679
Iterating global reduction 3 with 5 rules applied. Total rules applied 120 place count 735 transition count 679
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 122 place count 735 transition count 677
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 1361 edges and 733 vertex of which 731 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 3 rules applied. Total rules applied 125 place count 731 transition count 677
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 127 place count 731 transition count 675
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 130 place count 728 transition count 672
Iterating global reduction 6 with 3 rules applied. Total rules applied 133 place count 728 transition count 672
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 134 place count 727 transition count 671
Iterating global reduction 6 with 1 rules applied. Total rules applied 135 place count 727 transition count 671
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 140 place count 727 transition count 666
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 145 place count 722 transition count 666
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 153 place count 714 transition count 658
Applied a total of 153 rules in 395 ms. Remains 714 /798 variables (removed 84) and now considering 658/742 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 395 ms. Remains : 714/798 places, 658/742 transitions.
RANDOM walk for 40000 steps (56 resets) in 286 ms. (139 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 270256 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 5
Probabilistic random walk after 270256 steps, saw 69540 distinct states, run finished after 3007 ms. (steps per millisecond=89 ) properties seen :0
// Phase 1: matrix 658 rows 714 cols
[2024-05-25 13:24:53] [INFO ] Computed 56 invariants in 8 ms
[2024-05-25 13:24:53] [INFO ] State equation strengthened by 23 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 591/659 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/659 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 5/664 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/664 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 648/1312 variables, 664/720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1312 variables, 21/741 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1312 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 59/1371 variables, 49/790 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1371 variables, 2/792 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1371 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/1372 variables, 1/793 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1372 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1372 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1372/1372 variables, and 793 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5608 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 714/714 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 591/659 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/659 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 5/664 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/664 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 648/1312 variables, 664/720 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1312 variables, 21/741 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1312 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1312 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 59/1371 variables, 49/791 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1371 variables, 2/793 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1371 variables, 4/797 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1371 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/1372 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1372 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/1372 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1372/1372 variables, and 798 constraints, problems are : Problem set: 0 solved, 5 unsolved in 9656 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 714/714 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 15322ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 2649 ms.
Support contains 68 out of 714 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 658/658 transitions.
Applied a total of 0 rules in 41 ms. Remains 714 /714 variables (removed 0) and now considering 658/658 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 714/714 places, 658/658 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 658/658 transitions.
Applied a total of 0 rules in 58 ms. Remains 714 /714 variables (removed 0) and now considering 658/658 (removed 0) transitions.
[2024-05-25 13:25:11] [INFO ] Invariant cache hit.
[2024-05-25 13:25:11] [INFO ] Implicit Places using invariants in 869 ms returned []
[2024-05-25 13:25:11] [INFO ] Invariant cache hit.
[2024-05-25 13:25:13] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-25 13:25:14] [INFO ] Implicit Places using invariants and state equation in 3037 ms returned []
Implicit Place search using SMT with State Equation took 3931 ms to find 0 implicit places.
[2024-05-25 13:25:15] [INFO ] Redundant transitions in 54 ms returned []
Running 633 sub problems to find dead transitions.
[2024-05-25 13:25:15] [INFO ] Invariant cache hit.
[2024-05-25 13:25:15] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/689 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/689 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 2 (OVERLAPS) 23/712 variables, 50/56 constraints. Problems are: Problem set: 0 solved, 633 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 712/1372 variables, and 56 constraints, problems are : Problem set: 0 solved, 633 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 0/714 constraints, ReadFeed: 0/23 constraints, PredecessorRefiner: 633/633 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 633 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/689 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/689 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 2 (OVERLAPS) 23/712 variables, 50/56 constraints. Problems are: Problem set: 0 solved, 633 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/712 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 633 unsolved
SMT process timed out in 60434ms, After SMT, problems are : Problem set: 0 solved, 633 unsolved
Search for dead transitions found 0 dead transitions in 60451ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64514 ms. Remains : 714/714 places, 658/658 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 707 transition count 553
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 217 place count 602 transition count 553
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 217 place count 602 transition count 474
Deduced a syphon composed of 79 places in 5 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 375 place count 523 transition count 474
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 5 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 393 place count 514 transition count 465
Applied a total of 393 rules in 161 ms. Remains 514 /714 variables (removed 200) and now considering 465/658 (removed 193) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 465 rows 514 cols
[2024-05-25 13:26:15] [INFO ] Computed 49 invariants in 8 ms
[2024-05-25 13:26:16] [INFO ] [Real]Absence check using 0 positive and 49 generalized place invariants in 206 ms returned sat
[2024-05-25 13:26:16] [INFO ] After 1024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-25 13:26:17] [INFO ] [Nat]Absence check using 0 positive and 49 generalized place invariants in 185 ms returned sat
[2024-05-25 13:26:18] [INFO ] After 1406ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-25 13:26:19] [INFO ] After 2356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-25 13:26:20] [INFO ] After 3599ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 4852 ms.
[2024-05-25 13:26:20] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-05-25 13:26:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 714 places, 658 transitions and 2191 arcs took 16 ms.
[2024-05-25 13:26:20] [INFO ] Flatten gal took : 190 ms
Total runtime 125544 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running HirschbergSinclair-PT-50

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 714
TRANSITIONS: 658
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.030s, Sys 0.000s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.006s, 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: 617
MODEL NAME: /home/mcc/execution/415/model
714 places, 658 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.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="HirschbergSinclair-PT-50"
export BK_EXAMINATION="ReachabilityFireability"
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 HirschbergSinclair-PT-50, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r201-smll-171649586600135"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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