Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r060-tall-165254772300638.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Dekker-PT-200, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772300638
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 7.3K Apr 30 06:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 30 06:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 30 06:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 06:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 30 08:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 30 08:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 30 07:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 129K Apr 30 07:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 25M May 10 09:33 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 Dekker-PT-200-ReachabilityCardinality-00
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-01
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-02
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-03
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-04
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-05
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-06
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-07
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-08
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-09
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-10
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-11
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-12
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-13
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-14
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654188960736

Running Version 202205111006
[2022-06-02 16:56:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 16:56:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 16:56:03] [INFO ] Load time of PNML (sax parser for PT used): 1271 ms
[2022-06-02 16:56:03] [INFO ] Transformed 1000 places.
[2022-06-02 16:56:03] [INFO ] Transformed 40400 transitions.
[2022-06-02 16:56:03] [INFO ] Found NUPN structural information;
[2022-06-02 16:56:03] [INFO ] Parsed PT model containing 1000 places and 40400 transitions in 1583 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-200-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1376 ms. (steps per millisecond=7 ) properties (out of 13) seen :5
FORMULA Dekker-PT-200-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2022-06-02 16:56:05] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2022-06-02 16:56:05] [INFO ] Computed 600 place invariants in 43 ms
[2022-06-02 16:56:06] [INFO ] After 525ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-02 16:56:06] [INFO ] [Nat]Absence check using 400 positive place invariants in 67 ms returned sat
[2022-06-02 16:56:06] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 32 ms returned sat
[2022-06-02 16:56:07] [INFO ] After 556ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :3
[2022-06-02 16:56:07] [INFO ] State equation strengthened by 200 read => feed constraints.
[2022-06-02 16:56:08] [INFO ] After 357ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :5 sat :3
[2022-06-02 16:56:10] [INFO ] Deduced a trap composed of 4 places in 1450 ms of which 9 ms to minimize.
[2022-06-02 16:56:11] [INFO ] Deduced a trap composed of 4 places in 1472 ms of which 2 ms to minimize.
[2022-06-02 16:56:13] [INFO ] Deduced a trap composed of 4 places in 1375 ms of which 2 ms to minimize.
[2022-06-02 16:56:14] [INFO ] Deduced a trap composed of 4 places in 1321 ms of which 0 ms to minimize.
[2022-06-02 16:56:15] [INFO ] Deduced a trap composed of 4 places in 1281 ms of which 0 ms to minimize.
[2022-06-02 16:56:17] [INFO ] Deduced a trap composed of 6 places in 1409 ms of which 0 ms to minimize.
[2022-06-02 16:56:18] [INFO ] Deduced a trap composed of 4 places in 1388 ms of which 0 ms to minimize.
[2022-06-02 16:56:19] [INFO ] Deduced a trap composed of 4 places in 1249 ms of which 0 ms to minimize.
[2022-06-02 16:56:21] [INFO ] Deduced a trap composed of 4 places in 1281 ms of which 1 ms to minimize.
[2022-06-02 16:56:22] [INFO ] Deduced a trap composed of 6 places in 1228 ms of which 1 ms to minimize.
[2022-06-02 16:56:23] [INFO ] Deduced a trap composed of 4 places in 1211 ms of which 0 ms to minimize.
[2022-06-02 16:56:25] [INFO ] Deduced a trap composed of 4 places in 1262 ms of which 1 ms to minimize.
[2022-06-02 16:56:26] [INFO ] Deduced a trap composed of 4 places in 1239 ms of which 1 ms to minimize.
[2022-06-02 16:56:27] [INFO ] Deduced a trap composed of 6 places in 1265 ms of which 1 ms to minimize.
[2022-06-02 16:56:29] [INFO ] Deduced a trap composed of 4 places in 1294 ms of which 0 ms to minimize.
[2022-06-02 16:56:30] [INFO ] Deduced a trap composed of 4 places in 1170 ms of which 0 ms to minimize.
[2022-06-02 16:56:31] [INFO ] Deduced a trap composed of 4 places in 1168 ms of which 0 ms to minimize.
[2022-06-02 16:56:32] [INFO ] Deduced a trap composed of 4 places in 1172 ms of which 1 ms to minimize.
[2022-06-02 16:56:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-02 16:56:32] [INFO ] After 26096ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
FORMULA Dekker-PT-200-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-200-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-200-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-200-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-200-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 31 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1815 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 40400/40400 transitions.
Interrupted random walk after 384344 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen 0
Interrupted Best-First random walk after 833951 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=166 ) properties seen 0
Interrupted Best-First random walk after 817268 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=163 ) properties seen 0
Interrupted Best-First random walk after 726215 steps, including 2 resets, run timeout after 5002 ms. (steps per millisecond=145 ) properties seen 0
Probabilistic random walk exhausted memory after 2771589 steps, saw 2628590 distinct states, run finished after 91783 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 3 properties.
[2022-06-02 16:58:51] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2022-06-02 16:58:51] [INFO ] Computed 600 place invariants in 29 ms
[2022-06-02 16:58:51] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-02 16:58:52] [INFO ] [Nat]Absence check using 400 positive place invariants in 63 ms returned sat
[2022-06-02 16:58:52] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 33 ms returned sat
[2022-06-02 16:58:52] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-02 16:58:52] [INFO ] State equation strengthened by 200 read => feed constraints.
[2022-06-02 16:58:53] [INFO ] After 375ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-02 16:58:55] [INFO ] Deduced a trap composed of 4 places in 1293 ms of which 1 ms to minimize.
[2022-06-02 16:58:56] [INFO ] Deduced a trap composed of 4 places in 1358 ms of which 1 ms to minimize.
[2022-06-02 16:58:57] [INFO ] Deduced a trap composed of 4 places in 1280 ms of which 0 ms to minimize.
[2022-06-02 16:58:59] [INFO ] Deduced a trap composed of 4 places in 1318 ms of which 0 ms to minimize.
[2022-06-02 16:59:00] [INFO ] Deduced a trap composed of 4 places in 1251 ms of which 0 ms to minimize.
[2022-06-02 16:59:01] [INFO ] Deduced a trap composed of 4 places in 1250 ms of which 1 ms to minimize.
[2022-06-02 16:59:02] [INFO ] Deduced a trap composed of 4 places in 1228 ms of which 0 ms to minimize.
[2022-06-02 16:59:04] [INFO ] Deduced a trap composed of 6 places in 1260 ms of which 0 ms to minimize.
[2022-06-02 16:59:05] [INFO ] Deduced a trap composed of 4 places in 1197 ms of which 0 ms to minimize.
[2022-06-02 16:59:06] [INFO ] Deduced a trap composed of 4 places in 1202 ms of which 0 ms to minimize.
[2022-06-02 16:59:07] [INFO ] Deduced a trap composed of 4 places in 1156 ms of which 1 ms to minimize.
[2022-06-02 16:59:09] [INFO ] Deduced a trap composed of 6 places in 1170 ms of which 0 ms to minimize.
[2022-06-02 16:59:10] [INFO ] Deduced a trap composed of 4 places in 1152 ms of which 0 ms to minimize.
[2022-06-02 16:59:11] [INFO ] Deduced a trap composed of 4 places in 1201 ms of which 3 ms to minimize.
[2022-06-02 16:59:12] [INFO ] Deduced a trap composed of 4 places in 1192 ms of which 1 ms to minimize.
[2022-06-02 16:59:14] [INFO ] Deduced a trap composed of 4 places in 1182 ms of which 2 ms to minimize.
[2022-06-02 16:59:15] [INFO ] Deduced a trap composed of 4 places in 1175 ms of which 2 ms to minimize.
[2022-06-02 16:59:16] [INFO ] Deduced a trap composed of 6 places in 1171 ms of which 0 ms to minimize.
[2022-06-02 16:59:17] [INFO ] Deduced a trap composed of 4 places in 1147 ms of which 0 ms to minimize.
[2022-06-02 16:59:18] [INFO ] Deduced a trap composed of 4 places in 1154 ms of which 0 ms to minimize.
[2022-06-02 16:59:20] [INFO ] Deduced a trap composed of 4 places in 1107 ms of which 0 ms to minimize.
[2022-06-02 16:59:21] [INFO ] Deduced a trap composed of 4 places in 1102 ms of which 3 ms to minimize.
[2022-06-02 16:59:22] [INFO ] Deduced a trap composed of 4 places in 1129 ms of which 1 ms to minimize.
[2022-06-02 16:59:23] [INFO ] Deduced a trap composed of 4 places in 1106 ms of which 0 ms to minimize.
[2022-06-02 16:59:24] [INFO ] Deduced a trap composed of 4 places in 1101 ms of which 1 ms to minimize.
[2022-06-02 16:59:25] [INFO ] Deduced a trap composed of 4 places in 1112 ms of which 0 ms to minimize.
[2022-06-02 16:59:26] [INFO ] Deduced a trap composed of 4 places in 1054 ms of which 1 ms to minimize.
[2022-06-02 16:59:28] [INFO ] Deduced a trap composed of 4 places in 1116 ms of which 1 ms to minimize.
[2022-06-02 16:59:29] [INFO ] Deduced a trap composed of 4 places in 1060 ms of which 1 ms to minimize.
[2022-06-02 16:59:29] [INFO ] Trap strengthening procedure interrupted after too many repetitions 35541 ms
[2022-06-02 16:59:29] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 35541 ms
[2022-06-02 16:59:29] [INFO ] After 36329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 232 ms.
[2022-06-02 16:59:29] [INFO ] After 37659ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 31 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1895 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1000/1000 places, 40400/40400 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1571 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2022-06-02 16:59:32] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2022-06-02 16:59:32] [INFO ] Computed 600 place invariants in 5 ms
[2022-06-02 17:00:03] [INFO ] Performed 780/1000 implicitness test of which 122 returned IMPLICIT in 30 seconds.
[2022-06-02 17:00:04] [INFO ] Implicit Places using invariants in 31312 ms returned [400, 403, 406, 409, 412, 415, 418, 421, 424, 427, 430, 433, 436, 439, 442, 448, 451, 454, 457, 460, 463, 472, 475, 478, 481, 484, 487, 490, 493, 496, 499, 502, 505, 508, 511, 514, 520, 523, 526, 529, 532, 535, 538, 541, 544, 547, 550, 553, 556, 559, 562, 565, 568, 571, 574, 577, 580, 583, 586, 589, 592, 595, 598, 601, 604, 607, 610, 613, 616, 619, 622, 625, 628, 631, 634, 637, 640, 643, 646, 649, 652, 655, 658, 661, 664, 667, 670, 673, 676, 679, 682, 685, 688, 691, 694, 697, 703, 706, 709, 712, 715, 718, 721, 724, 727, 730, 733, 736, 739, 742, 745, 748, 751, 754, 757, 760, 763, 766, 769, 772, 775, 778, 781, 784, 787, 790, 796, 799, 802, 805, 808, 811, 814, 817, 820, 823, 826, 829, 832, 835, 838, 841, 844, 847, 850, 853, 856, 859, 862, 865, 868, 871, 874, 877, 880, 883, 886, 889, 892, 895, 898, 901, 904, 907, 910, 913, 916, 919, 922, 928, 931, 934, 937, 940, 946, 949, 952, 955, 958, 961, 964, 967, 970, 973, 976, 979, 982, 985, 988, 991, 994, 997]
Discarding 192 places :
Implicit Place search using SMT only with invariants took 31354 ms to find 192 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 808/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 920 ms. Remains 808 /808 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 808/1000 places, 40400/40400 transitions.
Interrupted random walk after 431098 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4908 ms. (steps per millisecond=203 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4997 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 847619 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=169 ) properties seen 0
Probabilistic random walk exhausted memory after 2625122 steps, saw 2504089 distinct states, run finished after 87860 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 3 properties.
[2022-06-02 17:02:18] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 808 cols
[2022-06-02 17:02:18] [INFO ] Computed 408 place invariants in 7 ms
[2022-06-02 17:02:18] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-02 17:02:18] [INFO ] [Nat]Absence check using 400 positive place invariants in 57 ms returned sat
[2022-06-02 17:02:18] [INFO ] [Nat]Absence check using 400 positive and 8 generalized place invariants in 3 ms returned sat
[2022-06-02 17:02:19] [INFO ] After 408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-02 17:02:19] [INFO ] State equation strengthened by 200 read => feed constraints.
[2022-06-02 17:02:19] [INFO ] After 313ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-02 17:02:21] [INFO ] Deduced a trap composed of 4 places in 1190 ms of which 1 ms to minimize.
[2022-06-02 17:02:22] [INFO ] Deduced a trap composed of 4 places in 1119 ms of which 0 ms to minimize.
[2022-06-02 17:02:23] [INFO ] Deduced a trap composed of 4 places in 1221 ms of which 1 ms to minimize.
[2022-06-02 17:02:24] [INFO ] Deduced a trap composed of 4 places in 1203 ms of which 0 ms to minimize.
[2022-06-02 17:02:25] [INFO ] Deduced a trap composed of 4 places in 1106 ms of which 0 ms to minimize.
[2022-06-02 17:02:27] [INFO ] Deduced a trap composed of 4 places in 1186 ms of which 0 ms to minimize.
[2022-06-02 17:02:28] [INFO ] Deduced a trap composed of 4 places in 1098 ms of which 0 ms to minimize.
[2022-06-02 17:02:29] [INFO ] Deduced a trap composed of 4 places in 1152 ms of which 4 ms to minimize.
[2022-06-02 17:02:30] [INFO ] Deduced a trap composed of 4 places in 1053 ms of which 0 ms to minimize.
[2022-06-02 17:02:31] [INFO ] Deduced a trap composed of 4 places in 1168 ms of which 0 ms to minimize.
[2022-06-02 17:02:32] [INFO ] Deduced a trap composed of 4 places in 1001 ms of which 0 ms to minimize.
[2022-06-02 17:02:32] [INFO ] Trap strengthening procedure interrupted after too many repetitions 12903 ms
[2022-06-02 17:02:32] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 12903 ms
[2022-06-02 17:02:32] [INFO ] After 13562ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 198 ms.
[2022-06-02 17:02:33] [INFO ] After 14670ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 31 out of 808 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 808/808 places, 40400/40400 transitions.
Applied a total of 0 rules in 1047 ms. Remains 808 /808 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 808/808 places, 40400/40400 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 808/808 places, 40400/40400 transitions.
Applied a total of 0 rules in 1041 ms. Remains 808 /808 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2022-06-02 17:02:35] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 808 cols
[2022-06-02 17:02:35] [INFO ] Computed 408 place invariants in 9 ms
[2022-06-02 17:02:42] [INFO ] Implicit Places using invariants in 7736 ms returned []
Implicit Place search using SMT only with invariants took 7746 ms to find 0 implicit places.
[2022-06-02 17:02:42] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 808 cols
[2022-06-02 17:02:42] [INFO ] Computed 408 place invariants in 9 ms
[2022-06-02 17:02:56] [INFO ] Dead Transitions using invariants and state equation in 13840 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 808/808 places, 40400/40400 transitions.
Interrupted random walk after 399708 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=13 ) properties seen 0
Interrupted Best-First random walk after 993947 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=198 ) properties seen 0
Interrupted Best-First random walk after 982490 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=196 ) properties seen 0
Interrupted Best-First random walk after 868724 steps, including 2 resets, run timeout after 5002 ms. (steps per millisecond=173 ) properties seen 0
Probabilistic random walk exhausted memory after 2625149 steps, saw 2504116 distinct states, run finished after 86410 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 3 properties.
[2022-06-02 17:05:08] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 808 cols
[2022-06-02 17:05:08] [INFO ] Computed 408 place invariants in 2 ms
[2022-06-02 17:05:08] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-02 17:05:08] [INFO ] [Nat]Absence check using 400 positive place invariants in 56 ms returned sat
[2022-06-02 17:05:08] [INFO ] [Nat]Absence check using 400 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-02 17:05:09] [INFO ] After 422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-02 17:05:09] [INFO ] State equation strengthened by 200 read => feed constraints.
[2022-06-02 17:05:09] [INFO ] After 328ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-02 17:05:11] [INFO ] Deduced a trap composed of 4 places in 1130 ms of which 1 ms to minimize.
[2022-06-02 17:05:12] [INFO ] Deduced a trap composed of 4 places in 1350 ms of which 0 ms to minimize.
[2022-06-02 17:05:13] [INFO ] Deduced a trap composed of 4 places in 1123 ms of which 0 ms to minimize.
[2022-06-02 17:05:15] [INFO ] Deduced a trap composed of 4 places in 1128 ms of which 1 ms to minimize.
[2022-06-02 17:05:16] [INFO ] Deduced a trap composed of 4 places in 1159 ms of which 1 ms to minimize.
[2022-06-02 17:05:17] [INFO ] Deduced a trap composed of 4 places in 1171 ms of which 1 ms to minimize.
[2022-06-02 17:05:18] [INFO ] Deduced a trap composed of 4 places in 1042 ms of which 3 ms to minimize.
[2022-06-02 17:05:19] [INFO ] Deduced a trap composed of 4 places in 1131 ms of which 4 ms to minimize.
[2022-06-02 17:05:20] [INFO ] Deduced a trap composed of 4 places in 1032 ms of which 0 ms to minimize.
[2022-06-02 17:05:21] [INFO ] Deduced a trap composed of 4 places in 1096 ms of which 0 ms to minimize.
[2022-06-02 17:05:22] [INFO ] Deduced a trap composed of 4 places in 1030 ms of which 0 ms to minimize.
[2022-06-02 17:05:22] [INFO ] Trap strengthening procedure interrupted after too many repetitions 12810 ms
[2022-06-02 17:05:22] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 12810 ms
[2022-06-02 17:05:23] [INFO ] After 13576ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 197 ms.
[2022-06-02 17:05:23] [INFO ] After 14740ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 31 out of 808 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 808/808 places, 40400/40400 transitions.
Applied a total of 0 rules in 992 ms. Remains 808 /808 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 808/808 places, 40400/40400 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 808/808 places, 40400/40400 transitions.
Applied a total of 0 rules in 1181 ms. Remains 808 /808 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2022-06-02 17:05:25] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 808 cols
[2022-06-02 17:05:25] [INFO ] Computed 408 place invariants in 6 ms
[2022-06-02 17:05:32] [INFO ] Implicit Places using invariants in 7416 ms returned []
Implicit Place search using SMT only with invariants took 7424 ms to find 0 implicit places.
[2022-06-02 17:05:32] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 808 cols
[2022-06-02 17:05:32] [INFO ] Computed 408 place invariants in 4 ms
[2022-06-02 17:05:47] [INFO ] Dead Transitions using invariants and state equation in 14243 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 808/808 places, 40400/40400 transitions.
Graph (complete) has 1240 edges and 808 vertex of which 128 are kept as prefixes of interest. Removing 680 places using SCC suffix rule.8 ms
Discarding 680 places :
Also discarding 34340 output transitions
Drop transitions removed 34340 transitions
Ensure Unique test removed 8 places
Ensure Unique test removed 5940 transitions
Reduce isomorphic transitions removed 5940 transitions.
Iterating post reduction 0 with 5948 rules applied. Total rules applied 5949 place count 120 transition count 120
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 5976 place count 102 transition count 111
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 5985 place count 102 transition count 102
Free-agglomeration rule applied 17 times.
Iterating global reduction 2 with 17 rules applied. Total rules applied 6002 place count 102 transition count 85
Ensure Unique test removed 17 places
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 51 rules applied. Total rules applied 6053 place count 68 transition count 68
Applied a total of 6053 rules in 197 ms. Remains 68 /808 variables (removed 740) and now considering 68/40400 (removed 40332) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 68 rows 68 cols
[2022-06-02 17:05:47] [INFO ] Computed 34 place invariants in 0 ms
[2022-06-02 17:05:47] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-02 17:05:47] [INFO ] [Nat]Absence check using 34 positive place invariants in 3 ms returned sat
[2022-06-02 17:05:47] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-02 17:05:47] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-06-02 17:05:47] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-06-02 17:05:47] [INFO ] Flatten gal took : 25 ms
[2022-06-02 17:05:47] [INFO ] Flatten gal took : 9 ms
[2022-06-02 17:05:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11435217358352200007.gal : 5 ms
[2022-06-02 17:05:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5275596266084058567.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11435217358352200007.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5275596266084058567.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality5275596266084058567.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :12 after 288
Reachability property Dekker-PT-200-ReachabilityCardinality-06 is true.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :288 after 147456
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :147456 after 4.24673e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5.43582e+09,0.071321,4180,2,107,10,1012,8,0,390,348,0
Total reachable state count : 5435817984

Verifying 3 reachability properties.
Invariant property Dekker-PT-200-ReachabilityCardinality-02 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-200-ReachabilityCardinality-02,8.49347e+07,0.071838,4180,2,101,10,1012,8,0,392,348,0
Reachability property Dekker-PT-200-ReachabilityCardinality-06 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-200-ReachabilityCardinality-06,1.17965e+06,0.072471,4180,2,93,10,1012,9,0,412,348,0
Reachability property Dekker-PT-200-ReachabilityCardinality-15 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-200-ReachabilityCardinality-15,1.05696e+09,0.076076,4180,2,185,10,1292,9,0,450,846,0
[2022-06-02 17:05:50] [INFO ] Flatten gal took : 1974 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13865236111924032219
[2022-06-02 17:05:51] [INFO ] Too many transitions (40400) to apply POR reductions. Disabling POR matrices.
[2022-06-02 17:05:52] [INFO ] Built C files in 1042ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13865236111924032219
Running compilation step : cd /tmp/ltsmin13865236111924032219;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-02 17:05:52] [INFO ] Applying decomposition
[2022-06-02 17:05:53] [INFO ] Flatten gal took : 2699 ms
[2022-06-02 17:05:55] [INFO ] Flatten gal took : 2189 ms
[2022-06-02 17:05:56] [INFO ] Input system was already deterministic with 40400 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12110160295216470045.txt' '-o' '/tmp/graph12110160295216470045.bin' '-w' '/tmp/graph12110160295216470045.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12110160295216470045.bin' '-l' '-1' '-v' '-w' '/tmp/graph12110160295216470045.weights' '-q' '0' '-e' '0.001'
[2022-06-02 17:05:59] [INFO ] Decomposing Gal with order
[2022-06-02 17:05:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 17:06:03] [INFO ] Removed a total of 120193 redundant transitions.
[2022-06-02 17:06:03] [INFO ] Flatten gal took : 2827 ms
[2022-06-02 17:06:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1338 ms.
[2022-06-02 17:06:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16939779660449264407.gal : 149 ms
[2022-06-02 17:06:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1557880221890076150.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16939779660449264407.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1557880221890076150.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
[2022-06-02 17:06:09] [INFO ] Ran tautology test, simplified 0 / 3 in 15827 ms.
[2022-06-02 17:06:09] [INFO ] BMC solution for property Dekker-PT-200-ReachabilityCardinality-02(UNSAT) depth K=0 took 22 ms
[2022-06-02 17:06:09] [INFO ] BMC solution for property Dekker-PT-200-ReachabilityCardinality-06(UNSAT) depth K=0 took 8 ms
[2022-06-02 17:06:09] [INFO ] BMC solution for property Dekker-PT-200-ReachabilityCardinality-15(UNSAT) depth K=0 took 1 ms
[2022-06-02 17:06:10] [INFO ] BMC solution for property Dekker-PT-200-ReachabilityCardinality-02(UNSAT) depth K=1 took 241 ms
[2022-06-02 17:06:10] [INFO ] BMC solution for property Dekker-PT-200-ReachabilityCardinality-06(UNSAT) depth K=1 took 318 ms
[2022-06-02 17:06:10] [INFO ] BMC solution for property Dekker-PT-200-ReachabilityCardinality-15(UNSAT) depth K=1 took 81 ms
Loading property file /tmp/ReachabilityCardinality1557880221890076150.prop.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 800 out of 40400 initially.
// Phase 1: matrix 800 rows 808 cols
[2022-06-02 17:06:21] [INFO ] Computed 408 place invariants in 27 ms
[2022-06-02 17:06:21] [INFO ] Computed 408 place invariants in 28 ms
[2022-06-02 17:06:31] [INFO ] Proved 808 variables to be positive in 10224 ms
[2022-06-02 17:06:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDekker-PT-200-ReachabilityCardinality-02
[2022-06-02 17:06:31] [INFO ] KInduction solution for property Dekker-PT-200-ReachabilityCardinality-02(SAT) depth K=0 took 156 ms
[2022-06-02 17:06:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDekker-PT-200-ReachabilityCardinality-06
[2022-06-02 17:06:31] [INFO ] KInduction solution for property Dekker-PT-200-ReachabilityCardinality-06(SAT) depth K=0 took 125 ms
[2022-06-02 17:06:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDekker-PT-200-ReachabilityCardinality-15
[2022-06-02 17:06:31] [INFO ] KInduction solution for property Dekker-PT-200-ReachabilityCardinality-15(SAT) depth K=0 took 160 ms
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
Reachability property Dekker-PT-200-ReachabilityCardinality-15 is true.
FORMULA Dekker-PT-200-ReachabilityCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property Dekker-PT-200-ReachabilityCardinality-06 is true.
FORMULA Dekker-PT-200-ReachabilityCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property Dekker-PT-200-ReachabilityCardinality-02 does not hold.
FORMULA Dekker-PT-200-ReachabilityCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 5 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.60694e+60,46.2699,236632,625,24,6218,20337,41242,4354,40,20998,0
Total reachable state count : 1.606938044258990275541962092341162602522e+60

Verifying 3 reachability properties.
Invariant property Dekker-PT-200-ReachabilityCardinality-02 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-200-ReachabilityCardinality-02,2,46.2963,236632,212,14,6218,20337,41253,4354,48,20998,0
Reachability property Dekker-PT-200-ReachabilityCardinality-06 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-200-ReachabilityCardinality-06,2,46.3294,236632,212,14,6218,20337,41277,4354,54,20998,0
Reachability property Dekker-PT-200-ReachabilityCardinality-15 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-200-ReachabilityCardinality-15,2,46.4902,236632,212,14,6218,20337,41358,4354,60,20998,0
[2022-06-02 17:06:52] [WARNING] Interrupting SMT solver.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-02 17:06:52] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-02 17:06:52] [WARNING] Unexpected error occurred while running SMT. Was verifying Dekker-PT-200-ReachabilityCardinality-02 SMT depth 2
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 2 more
[2022-06-02 17:06:52] [INFO ] During BMC, SMT solver timed out at depth 2
[2022-06-02 17:06:52] [INFO ] BMC solving timed out (3600000 secs) at depth 2
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-02 17:06:52] [WARNING] Unexpected error occurred while running SMT. Was verifying Dekker-PT-200-ReachabilityCardinality-02 K-induction depth 1
Exception in thread "Thread-9" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 2 more
[2022-06-02 17:06:52] [INFO ] SMT solved 0/ 3 properties. Interrupting SMT analysis.
Total runtime 651027 ms.

BK_STOP 1654189613074

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="Dekker-PT-200"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Dekker-PT-200, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r060-tall-165254772300638"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-200.tgz
mv Dekker-PT-200 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;