fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r233-tall-167856419400762
Last Updated
May 14, 2023

About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S16C04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1696.312 3600000.00 14023895.00 634.80 ???????F??F????? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r233-tall-167856419400762.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is MultiCrashLeafsetExtension-PT-S16C04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419400762
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 11K Feb 26 02:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 02:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 02:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 02:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 26 02:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 02:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.1M Mar 5 18:22 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 MultiCrashLeafsetExtension-PT-S16C04-CTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679604392938

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C04
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 20:46:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 20:46:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 20:46:34] [INFO ] Load time of PNML (sax parser for PT used): 254 ms
[2023-03-23 20:46:34] [INFO ] Transformed 4260 places.
[2023-03-23 20:46:34] [INFO ] Transformed 6027 transitions.
[2023-03-23 20:46:34] [INFO ] Parsed PT model containing 4260 places and 6027 transitions and 23774 arcs in 459 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 152 out of 4260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4260/4260 places, 6027/6027 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 4232 transition count 6027
Discarding 1059 places :
Symmetric choice reduction at 1 with 1059 rule applications. Total rules 1087 place count 3173 transition count 4968
Iterating global reduction 1 with 1059 rules applied. Total rules applied 2146 place count 3173 transition count 4968
Discarding 912 places :
Symmetric choice reduction at 1 with 912 rule applications. Total rules 3058 place count 2261 transition count 4056
Iterating global reduction 1 with 912 rules applied. Total rules applied 3970 place count 2261 transition count 4056
Discarding 182 places :
Symmetric choice reduction at 1 with 182 rule applications. Total rules 4152 place count 2079 transition count 3328
Iterating global reduction 1 with 182 rules applied. Total rules applied 4334 place count 2079 transition count 3328
Applied a total of 4334 rules in 877 ms. Remains 2079 /4260 variables (removed 2181) and now considering 3328/6027 (removed 2699) transitions.
[2023-03-23 20:46:35] [INFO ] Flow matrix only has 3056 transitions (discarded 272 similar events)
// Phase 1: matrix 3056 rows 2079 cols
[2023-03-23 20:46:36] [INFO ] Computed 469 place invariants in 191 ms
[2023-03-23 20:46:38] [INFO ] Implicit Places using invariants in 2542 ms returned [4, 8, 12, 14, 16, 18, 20, 26, 33, 42, 53, 66, 81, 97, 113, 117, 119, 134, 145, 154, 161, 166, 169, 191, 198, 201, 202, 204, 205, 210, 215, 222, 231, 242, 255, 269, 283, 285, 286, 287, 301, 311, 318, 323, 326, 329, 348, 355, 358, 359, 360, 362, 364, 367, 372, 379, 390, 401, 414, 426, 427, 430, 441, 448, 453, 458, 460, 462, 488, 491, 492, 493, 494, 495, 497, 499, 502, 508, 515, 524, 534, 544, 545, 546, 548, 555, 560, 563, 565, 569, 571, 590, 597, 600, 601, 602, 603, 604, 606, 608, 610, 613, 618, 625, 633, 641, 642, 643, 644, 645, 650, 653, 655, 657, 659, 661, 687, 690, 691, 693, 694, 696, 698, 700, 702, 705, 710, 719, 726, 727, 729, 734, 736, 741, 743, 745, 747, 766, 773, 777, 779, 780, 782, 784, 788, 790, 792, 798, 802, 806, 807, 808, 810, 812, 814, 819, 821, 824, 826, 845, 852, 855, 856, 857, 859, 863, 865, 867, 869, 871, 873, 875, 878, 881, 882, 883, 887, 889, 891, 893, 895, 897, 916, 918, 922, 925, 926, 927, 928, 929, 932, 934, 936, 938, 940, 942, 944, 948, 950, 951, 954, 958, 960, 962, 964, 966, 989, 996, 999, 1001, 1003, 1008, 1010, 1014, 1016, 1018, 1020, 1022, 1025, 1027, 1028, 1029, 1031, 1034, 1036, 1038, 1040, 1044, 1063, 1070, 1075, 1077, 1083, 1086, 1090, 1094, 1096, 1099, 1104, 1105, 1106, 1107, 1108, 1111, 1113, 1115, 1117, 1119, 1121, 1147, 1150, 1151, 1152, 1153, 1154, 1156, 1158, 1160, 1162, 1164, 1167, 1172, 1179, 1183, 1191, 1195, 1197, 1200, 1205, 1210, 1236, 1239, 1240, 1241, 1242, 1243, 1245, 1247, 1249, 1251, 1254, 1259, 1266, 1275, 1276, 1277, 1279, 1286, 1294, 1297, 1299, 1301, 1303, 1322, 1329, 1332, 1336, 1338, 1343, 1345, 1348, 1356, 1365, 1374, 1385, 1388, 1389, 1401, 1408, 1413, 1416, 1418, 1420, 1449, 1452, 1453, 1454, 1456, 1458, 1461, 1469, 1476, 1485, 1499, 1512, 1513, 1515, 1516, 1527, 1537, 1544, 1552, 1557, 1578, 1585, 1589, 1590, 1592, 1594, 1599, 1605, 1612, 1621, 1632, 1647, 1662, 1663, 1664, 1665, 1666, 1679, 1699, 1706, 1711, 1714, 1733, 1735, 1739, 1743, 1744, 1745, 1746, 1749, 1757, 1765, 1774, 1785, 1798, 1816, 1833, 1834, 1835, 1836, 1837, 1853, 1866, 1877, 1886, 1893, 1898, 1918]
Discarding 381 places :
Implicit Place search using SMT only with invariants took 2586 ms to find 381 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1698/4260 places, 3328/6027 transitions.
Discarding 91 places :
Symmetric choice reduction at 0 with 91 rule applications. Total rules 91 place count 1607 transition count 3237
Iterating global reduction 0 with 91 rules applied. Total rules applied 182 place count 1607 transition count 3237
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 272 place count 1517 transition count 3147
Iterating global reduction 0 with 90 rules applied. Total rules applied 362 place count 1517 transition count 3147
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 452 place count 1427 transition count 3057
Iterating global reduction 0 with 90 rules applied. Total rules applied 542 place count 1427 transition count 3057
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 550 place count 1419 transition count 3025
Iterating global reduction 0 with 8 rules applied. Total rules applied 558 place count 1419 transition count 3025
Applied a total of 558 rules in 271 ms. Remains 1419 /1698 variables (removed 279) and now considering 3025/3328 (removed 303) transitions.
[2023-03-23 20:46:38] [INFO ] Flow matrix only has 2753 transitions (discarded 272 similar events)
// Phase 1: matrix 2753 rows 1419 cols
[2023-03-23 20:46:38] [INFO ] Computed 88 place invariants in 44 ms
[2023-03-23 20:46:39] [INFO ] Implicit Places using invariants in 1011 ms returned []
[2023-03-23 20:46:39] [INFO ] Flow matrix only has 2753 transitions (discarded 272 similar events)
[2023-03-23 20:46:39] [INFO ] Invariant cache hit.
[2023-03-23 20:46:40] [INFO ] State equation strengthened by 1064 read => feed constraints.
[2023-03-23 20:46:53] [INFO ] Implicit Places using invariants and state equation in 13947 ms returned []
Implicit Place search using SMT with State Equation took 14965 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1419/4260 places, 3025/6027 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18700 ms. Remains : 1419/4260 places, 3025/6027 transitions.
Support contains 152 out of 1419 places after structural reductions.
[2023-03-23 20:46:54] [INFO ] Flatten gal took : 266 ms
[2023-03-23 20:46:54] [INFO ] Flatten gal took : 151 ms
[2023-03-23 20:46:54] [INFO ] Input system was already deterministic with 3025 transitions.
Support contains 151 out of 1419 places (down from 152) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 240 resets, run finished after 612 ms. (steps per millisecond=16 ) properties (out of 70) seen :30
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 40) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 39) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 36) seen :1
Running SMT prover for 35 properties.
[2023-03-23 20:46:55] [INFO ] Flow matrix only has 2753 transitions (discarded 272 similar events)
[2023-03-23 20:46:55] [INFO ] Invariant cache hit.
[2023-03-23 20:46:56] [INFO ] [Real]Absence check using 33 positive place invariants in 38 ms returned sat
[2023-03-23 20:46:56] [INFO ] [Real]Absence check using 33 positive and 55 generalized place invariants in 22 ms returned sat
[2023-03-23 20:46:58] [INFO ] After 1350ms SMT Verify possible using state equation in real domain returned unsat :8 sat :2 real:25
[2023-03-23 20:46:58] [INFO ] State equation strengthened by 1064 read => feed constraints.
[2023-03-23 20:46:59] [INFO ] After 375ms SMT Verify possible using 1064 Read/Feed constraints in real domain returned unsat :8 sat :0 real:27
[2023-03-23 20:46:59] [INFO ] After 3461ms SMT Verify possible using all constraints in real domain returned unsat :8 sat :0 real:27
[2023-03-23 20:46:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2023-03-23 20:46:59] [INFO ] [Nat]Absence check using 33 positive and 55 generalized place invariants in 14 ms returned sat
[2023-03-23 20:47:04] [INFO ] After 4019ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :27
[2023-03-23 20:47:10] [INFO ] After 6278ms SMT Verify possible using 1064 Read/Feed constraints in natural domain returned unsat :16 sat :19
[2023-03-23 20:47:11] [INFO ] Deduced a trap composed of 265 places in 688 ms of which 9 ms to minimize.
[2023-03-23 20:47:12] [INFO ] Deduced a trap composed of 233 places in 720 ms of which 2 ms to minimize.
[2023-03-23 20:47:13] [INFO ] Deduced a trap composed of 308 places in 709 ms of which 2 ms to minimize.
[2023-03-23 20:47:14] [INFO ] Deduced a trap composed of 296 places in 624 ms of which 2 ms to minimize.
[2023-03-23 20:47:14] [INFO ] Deduced a trap composed of 298 places in 641 ms of which 2 ms to minimize.
[2023-03-23 20:47:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4035 ms
[2023-03-23 20:47:16] [INFO ] Deduced a trap composed of 353 places in 642 ms of which 2 ms to minimize.
[2023-03-23 20:47:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 795 ms
[2023-03-23 20:47:17] [INFO ] Deduced a trap composed of 345 places in 649 ms of which 2 ms to minimize.
[2023-03-23 20:47:18] [INFO ] Deduced a trap composed of 256 places in 674 ms of which 1 ms to minimize.
[2023-03-23 20:47:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1609 ms
[2023-03-23 20:47:20] [INFO ] Deduced a trap composed of 318 places in 652 ms of which 2 ms to minimize.
[2023-03-23 20:47:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1098 ms
[2023-03-23 20:47:21] [INFO ] Deduced a trap composed of 335 places in 659 ms of which 2 ms to minimize.
[2023-03-23 20:47:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 809 ms
[2023-03-23 20:47:22] [INFO ] Deduced a trap composed of 291 places in 663 ms of which 1 ms to minimize.
[2023-03-23 20:47:23] [INFO ] Deduced a trap composed of 344 places in 658 ms of which 2 ms to minimize.
[2023-03-23 20:47:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1553 ms
[2023-03-23 20:47:24] [INFO ] Deduced a trap composed of 279 places in 633 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 20:47:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 20:47:24] [INFO ] After 25449ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0 real:27
Fused 35 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 35 out of 1419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1419/1419 places, 3025/3025 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 1419 transition count 3001
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 1395 transition count 3001
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 48 place count 1395 transition count 2968
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 114 place count 1362 transition count 2968
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 142 place count 1334 transition count 2907
Iterating global reduction 2 with 28 rules applied. Total rules applied 170 place count 1334 transition count 2907
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 186 place count 1318 transition count 2846
Iterating global reduction 2 with 16 rules applied. Total rules applied 202 place count 1318 transition count 2846
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 4 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 266 place count 1286 transition count 2814
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 282 place count 1270 transition count 2798
Iterating global reduction 2 with 16 rules applied. Total rules applied 298 place count 1270 transition count 2798
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 314 place count 1254 transition count 2734
Iterating global reduction 2 with 16 rules applied. Total rules applied 330 place count 1254 transition count 2734
Free-agglomeration rule (complex) applied 151 times.
Iterating global reduction 2 with 151 rules applied. Total rules applied 481 place count 1254 transition count 3141
Reduce places removed 151 places and 0 transitions.
Iterating post reduction 2 with 151 rules applied. Total rules applied 632 place count 1103 transition count 3141
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 3 with 32 rules applied. Total rules applied 664 place count 1103 transition count 3141
Applied a total of 664 rules in 750 ms. Remains 1103 /1419 variables (removed 316) and now considering 3141/3025 (removed -116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 751 ms. Remains : 1103/1419 places, 3141/3025 transitions.
Incomplete random walk after 10000 steps, including 411 resets, run finished after 580 ms. (steps per millisecond=17 ) properties (out of 19) seen :5
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-23 20:47:26] [INFO ] Flow matrix only has 2754 transitions (discarded 387 similar events)
// Phase 1: matrix 2754 rows 1103 cols
[2023-03-23 20:47:26] [INFO ] Computed 88 place invariants in 27 ms
[2023-03-23 20:47:26] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2023-03-23 20:47:27] [INFO ] [Real]Absence check using 31 positive and 57 generalized place invariants in 30 ms returned sat
[2023-03-23 20:47:28] [INFO ] After 1261ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:8
[2023-03-23 20:47:28] [INFO ] State equation strengthened by 1496 read => feed constraints.
[2023-03-23 20:47:29] [INFO ] After 637ms SMT Verify possible using 1496 Read/Feed constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-23 20:47:29] [INFO ] After 2487ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-23 20:47:29] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2023-03-23 20:47:29] [INFO ] [Nat]Absence check using 31 positive and 57 generalized place invariants in 35 ms returned sat
[2023-03-23 20:47:31] [INFO ] After 1747ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-23 20:47:35] [INFO ] After 4082ms SMT Verify possible using 1496 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-23 20:47:36] [INFO ] Deduced a trap composed of 222 places in 508 ms of which 1 ms to minimize.
[2023-03-23 20:47:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 654 ms
[2023-03-23 20:47:37] [INFO ] Deduced a trap composed of 142 places in 566 ms of which 1 ms to minimize.
[2023-03-23 20:47:37] [INFO ] Deduced a trap composed of 130 places in 564 ms of which 1 ms to minimize.
[2023-03-23 20:47:38] [INFO ] Deduced a trap composed of 229 places in 532 ms of which 1 ms to minimize.
[2023-03-23 20:47:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2055 ms
[2023-03-23 20:47:39] [INFO ] Deduced a trap composed of 121 places in 513 ms of which 1 ms to minimize.
[2023-03-23 20:47:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 717 ms
[2023-03-23 20:47:41] [INFO ] Deduced a trap composed of 130 places in 536 ms of which 1 ms to minimize.
[2023-03-23 20:47:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 704 ms
[2023-03-23 20:47:42] [INFO ] Deduced a trap composed of 117 places in 534 ms of which 1 ms to minimize.
[2023-03-23 20:47:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 737 ms
[2023-03-23 20:47:43] [INFO ] Deduced a trap composed of 130 places in 537 ms of which 1 ms to minimize.
[2023-03-23 20:47:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 818 ms
[2023-03-23 20:47:44] [INFO ] Deduced a trap composed of 142 places in 519 ms of which 2 ms to minimize.
[2023-03-23 20:47:45] [INFO ] Deduced a trap composed of 130 places in 510 ms of which 1 ms to minimize.
[2023-03-23 20:47:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1345 ms
[2023-03-23 20:47:46] [INFO ] Deduced a trap composed of 117 places in 519 ms of which 1 ms to minimize.
[2023-03-23 20:47:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 672 ms
[2023-03-23 20:47:46] [INFO ] After 14725ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 3089 ms.
[2023-03-23 20:47:49] [INFO ] After 20110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 12 ms.
Support contains 24 out of 1103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1103/1103 places, 3141/3141 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1103 transition count 3139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1101 transition count 3139
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 1101 transition count 3138
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1100 transition count 3138
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 1098 transition count 3133
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 1098 transition count 3133
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 1098 transition count 3130
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 1095 transition count 3130
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 1095 transition count 3130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 1094 transition count 3129
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 1094 transition count 3129
Applied a total of 20 rules in 346 ms. Remains 1094 /1103 variables (removed 9) and now considering 3129/3141 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 358 ms. Remains : 1094/1103 places, 3129/3141 transitions.
Incomplete random walk after 10000 steps, including 414 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-23 20:47:50] [INFO ] Flow matrix only has 2741 transitions (discarded 388 similar events)
// Phase 1: matrix 2741 rows 1094 cols
[2023-03-23 20:47:50] [INFO ] Computed 88 place invariants in 28 ms
[2023-03-23 20:47:50] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2023-03-23 20:47:50] [INFO ] [Real]Absence check using 33 positive and 55 generalized place invariants in 10 ms returned sat
[2023-03-23 20:47:52] [INFO ] After 1886ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-23 20:47:52] [INFO ] [Nat]Absence check using 33 positive place invariants in 29 ms returned sat
[2023-03-23 20:47:52] [INFO ] [Nat]Absence check using 33 positive and 55 generalized place invariants in 11 ms returned sat
[2023-03-23 20:47:54] [INFO ] After 1690ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-23 20:47:54] [INFO ] State equation strengthened by 1493 read => feed constraints.
[2023-03-23 20:47:58] [INFO ] After 4434ms SMT Verify possible using 1493 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-23 20:47:59] [INFO ] Deduced a trap composed of 175 places in 515 ms of which 1 ms to minimize.
[2023-03-23 20:48:00] [INFO ] Deduced a trap composed of 178 places in 509 ms of which 1 ms to minimize.
[2023-03-23 20:48:00] [INFO ] Deduced a trap composed of 225 places in 496 ms of which 1 ms to minimize.
[2023-03-23 20:48:01] [INFO ] Deduced a trap composed of 208 places in 495 ms of which 1 ms to minimize.
[2023-03-23 20:48:02] [INFO ] Deduced a trap composed of 169 places in 466 ms of which 1 ms to minimize.
[2023-03-23 20:48:03] [INFO ] Deduced a trap composed of 166 places in 499 ms of which 1 ms to minimize.
[2023-03-23 20:48:03] [INFO ] Deduced a trap composed of 127 places in 491 ms of which 1 ms to minimize.
[2023-03-23 20:48:04] [INFO ] Deduced a trap composed of 137 places in 494 ms of which 1 ms to minimize.
[2023-03-23 20:48:05] [INFO ] Deduced a trap composed of 156 places in 506 ms of which 2 ms to minimize.
[2023-03-23 20:48:05] [INFO ] Deduced a trap composed of 167 places in 499 ms of which 3 ms to minimize.
[2023-03-23 20:48:06] [INFO ] Deduced a trap composed of 186 places in 497 ms of which 1 ms to minimize.
[2023-03-23 20:48:07] [INFO ] Deduced a trap composed of 162 places in 543 ms of which 2 ms to minimize.
[2023-03-23 20:48:08] [INFO ] Deduced a trap composed of 199 places in 518 ms of which 1 ms to minimize.
[2023-03-23 20:48:08] [INFO ] Deduced a trap composed of 169 places in 491 ms of which 1 ms to minimize.
[2023-03-23 20:48:09] [INFO ] Deduced a trap composed of 189 places in 494 ms of which 2 ms to minimize.
[2023-03-23 20:48:10] [INFO ] Deduced a trap composed of 185 places in 551 ms of which 2 ms to minimize.
[2023-03-23 20:48:10] [INFO ] Deduced a trap composed of 244 places in 543 ms of which 1 ms to minimize.
[2023-03-23 20:48:11] [INFO ] Deduced a trap composed of 169 places in 482 ms of which 1 ms to minimize.
[2023-03-23 20:48:11] [INFO ] Deduced a trap composed of 177 places in 471 ms of which 1 ms to minimize.
[2023-03-23 20:48:12] [INFO ] Deduced a trap composed of 130 places in 492 ms of which 1 ms to minimize.
[2023-03-23 20:48:13] [INFO ] Deduced a trap composed of 137 places in 499 ms of which 1 ms to minimize.
[2023-03-23 20:48:13] [INFO ] Deduced a trap composed of 196 places in 512 ms of which 2 ms to minimize.
[2023-03-23 20:48:14] [INFO ] Deduced a trap composed of 168 places in 490 ms of which 3 ms to minimize.
[2023-03-23 20:48:15] [INFO ] Deduced a trap composed of 162 places in 479 ms of which 1 ms to minimize.
[2023-03-23 20:48:15] [INFO ] Deduced a trap composed of 141 places in 482 ms of which 1 ms to minimize.
[2023-03-23 20:48:16] [INFO ] Deduced a trap composed of 185 places in 533 ms of which 1 ms to minimize.
[2023-03-23 20:48:17] [INFO ] Deduced a trap composed of 137 places in 508 ms of which 1 ms to minimize.
[2023-03-23 20:48:17] [INFO ] Deduced a trap composed of 169 places in 477 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 20:48:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 20:48:17] [INFO ] After 25493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 8 ms.
Support contains 21 out of 1094 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1094/1094 places, 3129/3129 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1094 transition count 3128
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1093 transition count 3128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1092 transition count 3127
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1092 transition count 3127
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1092 transition count 3126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 1091 transition count 3126
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1091 transition count 3126
Applied a total of 7 rules in 263 ms. Remains 1091 /1094 variables (removed 3) and now considering 3126/3129 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 1091/1094 places, 3126/3129 transitions.
Incomplete random walk after 10000 steps, including 416 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :1
Running SMT prover for 8 properties.
[2023-03-23 20:48:18] [INFO ] Flow matrix only has 2738 transitions (discarded 388 similar events)
// Phase 1: matrix 2738 rows 1091 cols
[2023-03-23 20:48:18] [INFO ] Computed 88 place invariants in 41 ms
[2023-03-23 20:48:19] [INFO ] [Real]Absence check using 33 positive place invariants in 26 ms returned sat
[2023-03-23 20:48:19] [INFO ] [Real]Absence check using 33 positive and 55 generalized place invariants in 16 ms returned sat
[2023-03-23 20:48:20] [INFO ] After 1270ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2023-03-23 20:48:20] [INFO ] State equation strengthened by 1493 read => feed constraints.
[2023-03-23 20:48:20] [INFO ] After 204ms SMT Verify possible using 1493 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-23 20:48:20] [INFO ] After 1896ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-23 20:48:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 24 ms returned sat
[2023-03-23 20:48:21] [INFO ] [Nat]Absence check using 33 positive and 55 generalized place invariants in 11 ms returned sat
[2023-03-23 20:48:22] [INFO ] After 1302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-23 20:48:27] [INFO ] After 4665ms SMT Verify possible using 1493 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-23 20:48:28] [INFO ] Deduced a trap composed of 196 places in 490 ms of which 1 ms to minimize.
[2023-03-23 20:48:29] [INFO ] Deduced a trap composed of 103 places in 538 ms of which 1 ms to minimize.
[2023-03-23 20:48:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1257 ms
[2023-03-23 20:48:30] [INFO ] Deduced a trap composed of 190 places in 484 ms of which 1 ms to minimize.
[2023-03-23 20:48:31] [INFO ] Deduced a trap composed of 158 places in 480 ms of which 2 ms to minimize.
[2023-03-23 20:48:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1351 ms
[2023-03-23 20:48:32] [INFO ] Deduced a trap composed of 120 places in 478 ms of which 1 ms to minimize.
[2023-03-23 20:48:32] [INFO ] Deduced a trap composed of 135 places in 505 ms of which 1 ms to minimize.
[2023-03-23 20:48:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1425 ms
[2023-03-23 20:48:33] [INFO ] After 10803ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 2120 ms.
[2023-03-23 20:48:35] [INFO ] After 14603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 9 ms.
Support contains 16 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 3126/3126 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1091 transition count 3125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1090 transition count 3125
Applied a total of 2 rules in 151 ms. Remains 1090 /1091 variables (removed 1) and now considering 3125/3126 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 1090/1091 places, 3125/3126 transitions.
Successfully simplified 16 atomic propositions for a total of 16 simplifications.
[2023-03-23 20:48:35] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-23 20:48:35] [INFO ] Flatten gal took : 91 ms
FORMULA MultiCrashLeafsetExtension-PT-S16C04-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 20:48:35] [INFO ] Flatten gal took : 108 ms
[2023-03-23 20:48:35] [INFO ] Input system was already deterministic with 3025 transitions.
Support contains 91 out of 1419 places (down from 96) after GAL structural reductions.
Computed a total of 587 stabilizing places and 1392 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1419/1419 places, 3025/3025 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 1362 transition count 2920
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 1362 transition count 2920
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 154 place count 1322 transition count 2826
Iterating global reduction 0 with 40 rules applied. Total rules applied 194 place count 1322 transition count 2826
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 215 place count 1301 transition count 2742
Iterating global reduction 0 with 21 rules applied. Total rules applied 236 place count 1301 transition count 2742
Applied a total of 236 rules in 165 ms. Remains 1301 /1419 variables (removed 118) and now considering 2742/3025 (removed 283) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 1301/1419 places, 2742/3025 transitions.
[2023-03-23 20:48:36] [INFO ] Flatten gal took : 70 ms
[2023-03-23 20:48:36] [INFO ] Flatten gal took : 76 ms
[2023-03-23 20:48:36] [INFO ] Input system was already deterministic with 2742 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1419/1419 places, 3025/3025 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 1419 transition count 2997
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 1391 transition count 2997
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 56 place count 1391 transition count 2960
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 130 place count 1354 transition count 2960
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 166 place count 1318 transition count 2876
Iterating global reduction 2 with 36 rules applied. Total rules applied 202 place count 1318 transition count 2876
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 221 place count 1299 transition count 2803
Iterating global reduction 2 with 19 rules applied. Total rules applied 240 place count 1299 transition count 2803
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 306 place count 1266 transition count 2770
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 326 place count 1246 transition count 2750
Iterating global reduction 2 with 20 rules applied. Total rules applied 346 place count 1246 transition count 2750
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 366 place count 1226 transition count 2670
Iterating global reduction 2 with 20 rules applied. Total rules applied 386 place count 1226 transition count 2670
Applied a total of 386 rules in 426 ms. Remains 1226 /1419 variables (removed 193) and now considering 2670/3025 (removed 355) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 427 ms. Remains : 1226/1419 places, 2670/3025 transitions.
[2023-03-23 20:48:36] [INFO ] Flatten gal took : 60 ms
[2023-03-23 20:48:37] [INFO ] Flatten gal took : 67 ms
[2023-03-23 20:48:37] [INFO ] Input system was already deterministic with 2670 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1419/1419 places, 3025/3025 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 1369 transition count 2933
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 1369 transition count 2933
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 135 place count 1334 transition count 2850
Iterating global reduction 0 with 35 rules applied. Total rules applied 170 place count 1334 transition count 2850
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 188 place count 1316 transition count 2778
Iterating global reduction 0 with 18 rules applied. Total rules applied 206 place count 1316 transition count 2778
Applied a total of 206 rules in 180 ms. Remains 1316 /1419 variables (removed 103) and now considering 2778/3025 (removed 247) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 181 ms. Remains : 1316/1419 places, 2778/3025 transitions.
[2023-03-23 20:48:37] [INFO ] Flatten gal took : 64 ms
[2023-03-23 20:48:37] [INFO ] Flatten gal took : 73 ms
[2023-03-23 20:48:37] [INFO ] Input system was already deterministic with 2778 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1419/1419 places, 3025/3025 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 1363 transition count 2921
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 1363 transition count 2921
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 151 place count 1324 transition count 2828
Iterating global reduction 0 with 39 rules applied. Total rules applied 190 place count 1324 transition count 2828
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 210 place count 1304 transition count 2748
Iterating global reduction 0 with 20 rules applied. Total rules applied 230 place count 1304 transition count 2748
Applied a total of 230 rules in 161 ms. Remains 1304 /1419 variables (removed 115) and now considering 2748/3025 (removed 277) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 1304/1419 places, 2748/3025 transitions.
[2023-03-23 20:48:37] [INFO ] Flatten gal took : 60 ms
[2023-03-23 20:48:37] [INFO ] Flatten gal took : 68 ms
[2023-03-23 20:48:38] [INFO ] Input system was already deterministic with 2748 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1419/1419 places, 3025/3025 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 1419 transition count 2997
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 1391 transition count 2997
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 56 place count 1391 transition count 2959
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 132 place count 1353 transition count 2959
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 170 place count 1315 transition count 2870
Iterating global reduction 2 with 38 rules applied. Total rules applied 208 place count 1315 transition count 2870
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 228 place count 1295 transition count 2793
Iterating global reduction 2 with 20 rules applied. Total rules applied 248 place count 1295 transition count 2793
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 314 place count 1262 transition count 2760
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 334 place count 1242 transition count 2740
Iterating global reduction 2 with 20 rules applied. Total rules applied 354 place count 1242 transition count 2740
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 374 place count 1222 transition count 2660
Iterating global reduction 2 with 20 rules applied. Total rules applied 394 place count 1222 transition count 2660
Applied a total of 394 rules in 397 ms. Remains 1222 /1419 variables (removed 197) and now considering 2660/3025 (removed 365) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 400 ms. Remains : 1222/1419 places, 2660/3025 transitions.
[2023-03-23 20:48:38] [INFO ] Flatten gal took : 55 ms
[2023-03-23 20:48:38] [INFO ] Flatten gal took : 61 ms
[2023-03-23 20:48:38] [INFO ] Input system was already deterministic with 2660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1419/1419 places, 3025/3025 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 1364 transition count 2919
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 1364 transition count 2919
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 147 place count 1327 transition count 2834
Iterating global reduction 0 with 37 rules applied. Total rules applied 184 place count 1327 transition count 2834
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 204 place count 1307 transition count 2754
Iterating global reduction 0 with 20 rules applied. Total rules applied 224 place count 1307 transition count 2754
Applied a total of 224 rules in 170 ms. Remains 1307 /1419 variables (removed 112) and now considering 2754/3025 (removed 271) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 1307/1419 places, 2754/3025 transitions.
[2023-03-23 20:48:39] [INFO ] Flatten gal took : 60 ms
[2023-03-23 20:48:39] [INFO ] Flatten gal took : 65 ms
[2023-03-23 20:48:39] [INFO ] Input system was already deterministic with 2754 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1419/1419 places, 3025/3025 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 1364 transition count 2925
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 1364 transition count 2925
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 149 place count 1325 transition count 2832
Iterating global reduction 0 with 39 rules applied. Total rules applied 188 place count 1325 transition count 2832
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 209 place count 1304 transition count 2748
Iterating global reduction 0 with 21 rules applied. Total rules applied 230 place count 1304 transition count 2748
Applied a total of 230 rules in 178 ms. Remains 1304 /1419 variables (removed 115) and now considering 2748/3025 (removed 277) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 1304/1419 places, 2748/3025 transitions.
[2023-03-23 20:48:39] [INFO ] Flatten gal took : 57 ms
[2023-03-23 20:48:39] [INFO ] Flatten gal took : 65 ms
[2023-03-23 20:48:39] [INFO ] Input system was already deterministic with 2748 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1419/1419 places, 3025/3025 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 1368 transition count 2926
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 1368 transition count 2926
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 136 place count 1334 transition count 2844
Iterating global reduction 0 with 34 rules applied. Total rules applied 170 place count 1334 transition count 2844
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 187 place count 1317 transition count 2776
Iterating global reduction 0 with 17 rules applied. Total rules applied 204 place count 1317 transition count 2776
Applied a total of 204 rules in 178 ms. Remains 1317 /1419 variables (removed 102) and now considering 2776/3025 (removed 249) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 1317/1419 places, 2776/3025 transitions.
[2023-03-23 20:48:39] [INFO ] Flatten gal took : 59 ms
[2023-03-23 20:48:39] [INFO ] Flatten gal took : 65 ms
[2023-03-23 20:48:40] [INFO ] Input system was already deterministic with 2776 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1419/1419 places, 3025/3025 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1419 transition count 3000
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 1394 transition count 3000
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 50 place count 1394 transition count 2962
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 126 place count 1356 transition count 2962
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 164 place count 1318 transition count 2873
Iterating global reduction 2 with 38 rules applied. Total rules applied 202 place count 1318 transition count 2873
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 222 place count 1298 transition count 2796
Iterating global reduction 2 with 20 rules applied. Total rules applied 242 place count 1298 transition count 2796
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 308 place count 1265 transition count 2763
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 325 place count 1248 transition count 2746
Iterating global reduction 2 with 17 rules applied. Total rules applied 342 place count 1248 transition count 2746
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 359 place count 1231 transition count 2678
Iterating global reduction 2 with 17 rules applied. Total rules applied 376 place count 1231 transition count 2678
Applied a total of 376 rules in 370 ms. Remains 1231 /1419 variables (removed 188) and now considering 2678/3025 (removed 347) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 370 ms. Remains : 1231/1419 places, 2678/3025 transitions.
[2023-03-23 20:48:40] [INFO ] Flatten gal took : 51 ms
[2023-03-23 20:48:40] [INFO ] Flatten gal took : 57 ms
[2023-03-23 20:48:40] [INFO ] Input system was already deterministic with 2678 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1419/1419 places, 3025/3025 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 1419 transition count 2997
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 1391 transition count 2997
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 56 place count 1391 transition count 2960
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 130 place count 1354 transition count 2960
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 167 place count 1317 transition count 2872
Iterating global reduction 2 with 37 rules applied. Total rules applied 204 place count 1317 transition count 2872
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 223 place count 1298 transition count 2799
Iterating global reduction 2 with 19 rules applied. Total rules applied 242 place count 1298 transition count 2799
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 308 place count 1265 transition count 2766
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 328 place count 1245 transition count 2746
Iterating global reduction 2 with 20 rules applied. Total rules applied 348 place count 1245 transition count 2746
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 368 place count 1225 transition count 2666
Iterating global reduction 2 with 20 rules applied. Total rules applied 388 place count 1225 transition count 2666
Applied a total of 388 rules in 357 ms. Remains 1225 /1419 variables (removed 194) and now considering 2666/3025 (removed 359) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 358 ms. Remains : 1225/1419 places, 2666/3025 transitions.
[2023-03-23 20:48:41] [INFO ] Flatten gal took : 50 ms
[2023-03-23 20:48:41] [INFO ] Flatten gal took : 55 ms
[2023-03-23 20:48:41] [INFO ] Input system was already deterministic with 2666 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1419/1419 places, 3025/3025 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 1362 transition count 2917
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 1362 transition count 2917
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 153 place count 1323 transition count 2827
Iterating global reduction 0 with 39 rules applied. Total rules applied 192 place count 1323 transition count 2827
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 213 place count 1302 transition count 2743
Iterating global reduction 0 with 21 rules applied. Total rules applied 234 place count 1302 transition count 2743
Applied a total of 234 rules in 156 ms. Remains 1302 /1419 variables (removed 117) and now considering 2743/3025 (removed 282) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 1302/1419 places, 2743/3025 transitions.
[2023-03-23 20:48:41] [INFO ] Flatten gal took : 55 ms
[2023-03-23 20:48:41] [INFO ] Flatten gal took : 61 ms
[2023-03-23 20:48:41] [INFO ] Input system was already deterministic with 2743 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1419/1419 places, 3025/3025 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 1419 transition count 2997
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 1391 transition count 2997
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 56 place count 1391 transition count 2959
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 132 place count 1353 transition count 2959
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 169 place count 1316 transition count 2874
Iterating global reduction 2 with 37 rules applied. Total rules applied 206 place count 1316 transition count 2874
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 226 place count 1296 transition count 2797
Iterating global reduction 2 with 20 rules applied. Total rules applied 246 place count 1296 transition count 2797
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 312 place count 1263 transition count 2764
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 332 place count 1243 transition count 2744
Iterating global reduction 2 with 20 rules applied. Total rules applied 352 place count 1243 transition count 2744
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 372 place count 1223 transition count 2664
Iterating global reduction 2 with 20 rules applied. Total rules applied 392 place count 1223 transition count 2664
Applied a total of 392 rules in 346 ms. Remains 1223 /1419 variables (removed 196) and now considering 2664/3025 (removed 361) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 347 ms. Remains : 1223/1419 places, 2664/3025 transitions.
[2023-03-23 20:48:42] [INFO ] Flatten gal took : 48 ms
[2023-03-23 20:48:42] [INFO ] Flatten gal took : 54 ms
[2023-03-23 20:48:42] [INFO ] Input system was already deterministic with 2664 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1419/1419 places, 3025/3025 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1419 transition count 2999
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1393 transition count 2999
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 52 place count 1393 transition count 2962
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 126 place count 1356 transition count 2962
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 163 place count 1319 transition count 2874
Iterating global reduction 2 with 37 rules applied. Total rules applied 200 place count 1319 transition count 2874
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 219 place count 1300 transition count 2801
Iterating global reduction 2 with 19 rules applied. Total rules applied 238 place count 1300 transition count 2801
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 304 place count 1267 transition count 2768
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 322 place count 1249 transition count 2750
Iterating global reduction 2 with 18 rules applied. Total rules applied 340 place count 1249 transition count 2750
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 358 place count 1231 transition count 2678
Iterating global reduction 2 with 18 rules applied. Total rules applied 376 place count 1231 transition count 2678
Applied a total of 376 rules in 312 ms. Remains 1231 /1419 variables (removed 188) and now considering 2678/3025 (removed 347) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 312 ms. Remains : 1231/1419 places, 2678/3025 transitions.
[2023-03-23 20:48:42] [INFO ] Flatten gal took : 49 ms
[2023-03-23 20:48:42] [INFO ] Flatten gal took : 56 ms
[2023-03-23 20:48:42] [INFO ] Input system was already deterministic with 2678 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1419/1419 places, 3025/3025 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 1419 transition count 2998
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 1392 transition count 2998
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 54 place count 1392 transition count 2960
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 130 place count 1354 transition count 2960
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 167 place count 1317 transition count 2875
Iterating global reduction 2 with 37 rules applied. Total rules applied 204 place count 1317 transition count 2875
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 224 place count 1297 transition count 2798
Iterating global reduction 2 with 20 rules applied. Total rules applied 244 place count 1297 transition count 2798
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 310 place count 1264 transition count 2765
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 329 place count 1245 transition count 2746
Iterating global reduction 2 with 19 rules applied. Total rules applied 348 place count 1245 transition count 2746
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 367 place count 1226 transition count 2670
Iterating global reduction 2 with 19 rules applied. Total rules applied 386 place count 1226 transition count 2670
Applied a total of 386 rules in 333 ms. Remains 1226 /1419 variables (removed 193) and now considering 2670/3025 (removed 355) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 334 ms. Remains : 1226/1419 places, 2670/3025 transitions.
[2023-03-23 20:48:43] [INFO ] Flatten gal took : 46 ms
[2023-03-23 20:48:43] [INFO ] Flatten gal took : 54 ms
[2023-03-23 20:48:43] [INFO ] Input system was already deterministic with 2670 transitions.
[2023-03-23 20:48:43] [INFO ] Flatten gal took : 67 ms
[2023-03-23 20:48:43] [INFO ] Flatten gal took : 69 ms
[2023-03-23 20:48:43] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-23 20:48:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1419 places, 3025 transitions and 13331 arcs took 19 ms.
Total runtime 129202 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/672/ctl_0_ --ctl=/tmp/672/ctl_1_ --ctl=/tmp/672/ctl_2_ --ctl=/tmp/672/ctl_3_ --ctl=/tmp/672/ctl_4_ --ctl=/tmp/672/ctl_5_ --ctl=/tmp/672/ctl_6_ --ctl=/tmp/672/ctl_7_ --ctl=/tmp/672/ctl_8_ --ctl=/tmp/672/ctl_9_ --ctl=/tmp/672/ctl_10_ --ctl=/tmp/672/ctl_11_ --ctl=/tmp/672/ctl_12_ --ctl=/tmp/672/ctl_13_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14756044 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16090468 kB

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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023

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="MultiCrashLeafsetExtension-PT-S16C04"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C04, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-167856419400762"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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