Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 04:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 12 04:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 25M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716414480992

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-200
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 21:48:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 21:48:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 21:48:03] [INFO ] Load time of PNML (sax parser for PT used): 1006 ms
[2024-05-22 21:48:03] [INFO ] Transformed 1000 places.
[2024-05-22 21:48:03] [INFO ] Transformed 40400 transitions.
[2024-05-22 21:48:03] [INFO ] Found NUPN structural information;
[2024-05-22 21:48:03] [INFO ] Parsed PT model containing 1000 places and 40400 transitions and 320400 arcs in 1284 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Dekker-PT-200-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1156 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 21:48:05] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2024-05-22 21:48:05] [INFO ] Computed 600 invariants in 52 ms
[2024-05-22 21:48:35] [INFO ] Performed 853/1000 implicitness test of which 151 returned IMPLICIT in 30 seconds.
[2024-05-22 21:48:36] [INFO ] Implicit Places using invariants in 31042 ms returned [400, 403, 406, 409, 412, 415, 418, 421, 424, 427, 430, 436, 439, 442, 445, 448, 451, 454, 457, 460, 463, 466, 469, 472, 475, 478, 481, 484, 487, 490, 493, 496, 499, 502, 505, 508, 511, 514, 517, 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, 700, 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, 793, 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, 925, 931, 934, 937, 940, 943, 946, 949, 952, 955, 958, 961, 964, 967, 970, 973, 979, 982, 985, 988, 991, 994, 997]
Discarding 197 places :
Implicit Place search using SMT only with invariants took 31120 ms to find 197 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 803/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 840 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33125 ms. Remains : 803/1000 places, 40400/40400 transitions.
Support contains 26 out of 803 places after structural reductions.
[2024-05-22 21:48:39] [INFO ] Flatten gal took : 1712 ms
[2024-05-22 21:48:40] [INFO ] Flatten gal took : 1345 ms
[2024-05-22 21:48:43] [INFO ] Input system was already deterministic with 40400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 845 ms. (steps per millisecond=11 ) properties (out of 17) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-22 21:48:44] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 803 cols
[2024-05-22 21:48:44] [INFO ] Computed 403 invariants in 12 ms
[2024-05-22 21:48:44] [INFO ] [Real]Absence check using 400 positive place invariants in 56 ms returned sat
[2024-05-22 21:48:44] [INFO ] [Real]Absence check using 400 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-22 21:48:45] [INFO ] After 463ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2024-05-22 21:48:45] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-22 21:48:45] [INFO ] After 222ms SMT Verify possible using 200 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 21:48:45] [INFO ] After 1349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 21:48:46] [INFO ] [Nat]Absence check using 400 positive place invariants in 56 ms returned sat
[2024-05-22 21:48:46] [INFO ] [Nat]Absence check using 400 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-22 21:48:46] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 21:48:46] [INFO ] After 320ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-22 21:48:48] [INFO ] Deduced a trap composed of 4 places in 1143 ms of which 8 ms to minimize.
[2024-05-22 21:48:49] [INFO ] Deduced a trap composed of 4 places in 1152 ms of which 2 ms to minimize.
[2024-05-22 21:48:50] [INFO ] Deduced a trap composed of 4 places in 1109 ms of which 2 ms to minimize.
[2024-05-22 21:48:52] [INFO ] Deduced a trap composed of 4 places in 1128 ms of which 1 ms to minimize.
[2024-05-22 21:48:53] [INFO ] Deduced a trap composed of 4 places in 1084 ms of which 2 ms to minimize.
[2024-05-22 21:48:54] [INFO ] Deduced a trap composed of 4 places in 1086 ms of which 1 ms to minimize.
[2024-05-22 21:48:55] [INFO ] Deduced a trap composed of 4 places in 1166 ms of which 1 ms to minimize.
[2024-05-22 21:48:56] [INFO ] Deduced a trap composed of 4 places in 1096 ms of which 0 ms to minimize.
[2024-05-22 21:48:57] [INFO ] Deduced a trap composed of 4 places in 1069 ms of which 0 ms to minimize.
[2024-05-22 21:48:58] [INFO ] Deduced a trap composed of 4 places in 1064 ms of which 0 ms to minimize.
[2024-05-22 21:48:59] [INFO ] Deduced a trap composed of 4 places in 1042 ms of which 0 ms to minimize.
[2024-05-22 21:48:59] [INFO ] Trap strengthening procedure interrupted after too many repetitions 12526 ms
[2024-05-22 21:48:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 12528 ms
[2024-05-22 21:48:59] [INFO ] After 13357ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 190 ms.
[2024-05-22 21:49:00] [INFO ] After 14316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 55 ms.
Support contains 8 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 1253 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1256 ms. Remains : 803/803 places, 40400/40400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 720 ms. (steps per millisecond=13 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 128037 steps, run timeout after 3003 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 128037 steps, saw 123694 distinct states, run finished after 3005 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-22 21:49:05] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:49:05] [INFO ] Invariant cache hit.
[2024-05-22 21:49:05] [INFO ] [Real]Absence check using 400 positive place invariants in 56 ms returned sat
[2024-05-22 21:49:05] [INFO ] [Real]Absence check using 400 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-22 21:49:06] [INFO ] After 448ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2024-05-22 21:49:06] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-22 21:49:06] [INFO ] After 208ms SMT Verify possible using 200 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 21:49:06] [INFO ] After 1161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 21:49:06] [INFO ] [Nat]Absence check using 400 positive place invariants in 60 ms returned sat
[2024-05-22 21:49:06] [INFO ] [Nat]Absence check using 400 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-22 21:49:07] [INFO ] After 390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 21:49:07] [INFO ] After 333ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-22 21:49:09] [INFO ] Deduced a trap composed of 4 places in 1287 ms of which 0 ms to minimize.
[2024-05-22 21:49:10] [INFO ] Deduced a trap composed of 4 places in 1268 ms of which 1 ms to minimize.
[2024-05-22 21:49:12] [INFO ] Deduced a trap composed of 4 places in 1279 ms of which 0 ms to minimize.
[2024-05-22 21:49:13] [INFO ] Deduced a trap composed of 4 places in 1245 ms of which 0 ms to minimize.
[2024-05-22 21:49:14] [INFO ] Deduced a trap composed of 4 places in 1222 ms of which 0 ms to minimize.
[2024-05-22 21:49:15] [INFO ] Deduced a trap composed of 4 places in 1212 ms of which 1 ms to minimize.
[2024-05-22 21:49:17] [INFO ] Deduced a trap composed of 4 places in 1200 ms of which 1 ms to minimize.
[2024-05-22 21:49:18] [INFO ] Deduced a trap composed of 4 places in 1075 ms of which 0 ms to minimize.
[2024-05-22 21:49:19] [INFO ] Deduced a trap composed of 4 places in 1209 ms of which 0 ms to minimize.
[2024-05-22 21:49:20] [INFO ] Deduced a trap composed of 4 places in 1192 ms of which 1 ms to minimize.
[2024-05-22 21:49:21] [INFO ] Deduced a trap composed of 4 places in 1193 ms of which 1 ms to minimize.
[2024-05-22 21:49:21] [INFO ] Trap strengthening procedure interrupted after too many repetitions 13757 ms
[2024-05-22 21:49:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 13757 ms
[2024-05-22 21:49:21] [INFO ] After 14561ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 191 ms.
[2024-05-22 21:49:22] [INFO ] After 15422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 8 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 1021 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1021 ms. Remains : 803/803 places, 40400/40400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 998 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 21:49:24] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:49:24] [INFO ] Invariant cache hit.
[2024-05-22 21:49:30] [INFO ] Implicit Places using invariants in 6541 ms returned [422, 753, 786]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 6571 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 800/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 977 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8550 ms. Remains : 800/803 places, 40400/40400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 731 ms. (steps per millisecond=13 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 130650 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 130650 steps, saw 126199 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-22 21:49:35] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2024-05-22 21:49:35] [INFO ] Computed 400 invariants in 7 ms
[2024-05-22 21:49:35] [INFO ] [Real]Absence check using 400 positive place invariants in 60 ms returned sat
[2024-05-22 21:49:36] [INFO ] After 467ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2024-05-22 21:49:36] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-22 21:49:36] [INFO ] After 237ms SMT Verify possible using 200 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 21:49:36] [INFO ] After 1232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 21:49:37] [INFO ] [Nat]Absence check using 400 positive place invariants in 54 ms returned sat
[2024-05-22 21:49:37] [INFO ] After 387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 21:49:37] [INFO ] After 318ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-22 21:49:38] [INFO ] After 832ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 173 ms.
[2024-05-22 21:49:38] [INFO ] After 1677ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 8 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 1365 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1368 ms. Remains : 800/800 places, 40400/40400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 942 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 21:49:40] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:49:40] [INFO ] Invariant cache hit.
[2024-05-22 21:49:47] [INFO ] Implicit Places using invariants in 6552 ms returned []
Implicit Place search using SMT only with invariants took 6557 ms to find 0 implicit places.
[2024-05-22 21:49:47] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:49:47] [INFO ] Invariant cache hit.
[2024-05-22 21:50:00] [INFO ] Dead Transitions using invariants and state equation in 12898 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20402 ms. Remains : 800/800 places, 40400/40400 transitions.
Graph (complete) has 1200 edges and 800 vertex of which 32 are kept as prefixes of interest. Removing 768 places using SCC suffix rule.7 ms
Discarding 768 places :
Also discarding 38784 output transitions
Drop transitions removed 38784 transitions
Ensure Unique test removed 1584 transitions
Reduce isomorphic transitions removed 1584 transitions.
Iterating post reduction 0 with 1584 rules applied. Total rules applied 1585 place count 32 transition count 32
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 1606 place count 18 transition count 25
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 1613 place count 18 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1614 place count 18 transition count 17
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1617 place count 16 transition count 16
Applied a total of 1617 rules in 93 ms. Remains 16 /800 variables (removed 784) and now considering 16/40400 (removed 40384) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 16 rows 16 cols
[2024-05-22 21:50:00] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 21:50:00] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-22 21:50:00] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2024-05-22 21:50:00] [INFO ] After 17ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-22 21:50:00] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:4
[2024-05-22 21:50:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-22 21:50:00] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 21:50:00] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-22 21:50:00] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA Dekker-PT-200-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 1527 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 21:50:03] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 803 cols
[2024-05-22 21:50:03] [INFO ] Computed 403 invariants in 6 ms
[2024-05-22 21:50:09] [INFO ] Implicit Places using invariants in 6814 ms returned [422, 753, 786]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 6846 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 800/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 1591 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9966 ms. Remains : 800/803 places, 40400/40400 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-200-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s674 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 268 reset in 6171 ms.
Stack based approach found an accepted trace after 480 steps with 0 reset with depth 481 and stack size 480 in 35 ms.
FORMULA Dekker-PT-200-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-200-LTLCardinality-02 finished in 16464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 1554 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 21:50:19] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:50:19] [INFO ] Invariant cache hit.
[2024-05-22 21:50:26] [INFO ] Implicit Places using invariants in 6896 ms returned [422, 753, 786]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 6931 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 800/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 1533 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10020 ms. Remains : 800/803 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-200-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s171 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 5542 ms.
Stack based approach found an accepted trace after 296 steps with 0 reset with depth 297 and stack size 295 in 20 ms.
FORMULA Dekker-PT-200-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-200-LTLCardinality-03 finished in 15709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)&&p0)))))'
Support contains 3 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 682 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 21:50:34] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:50:34] [INFO ] Invariant cache hit.
[2024-05-22 21:50:40] [INFO ] Implicit Places using invariants in 6638 ms returned [422]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 6680 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 802/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 691 ms. Remains 802 /802 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8054 ms. Remains : 802/803 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Dekker-PT-200-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (NEQ s785 0) (NEQ s752 1)), p1:(EQ s565 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 5366 ms.
Stack based approach found an accepted trace after 414 steps with 0 reset with depth 415 and stack size 415 in 25 ms.
FORMULA Dekker-PT-200-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-200-LTLCardinality-04 finished in 13669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(p0)))))'
Support contains 4 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 658 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 21:50:47] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:50:47] [INFO ] Invariant cache hit.
[2024-05-22 21:50:54] [INFO ] Implicit Places using invariants in 6448 ms returned [422, 753, 786]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 6478 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 800/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 706 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7844 ms. Remains : 800/803 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Dekker-PT-200-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p0:(AND (NEQ s718 0) (NEQ s500 1) (NEQ s189 0) (NEQ s203 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA Dekker-PT-200-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-200-LTLCardinality-05 finished in 8095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(F(p2)||p1)))))'
Support contains 5 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 1468 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 21:50:56] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:50:56] [INFO ] Invariant cache hit.
[2024-05-22 21:51:03] [INFO ] Implicit Places using invariants in 6633 ms returned [422, 753, 786]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 6666 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 800/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 1478 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9614 ms. Remains : 800/803 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Dekker-PT-200-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s701 0) (EQ s673 1) (EQ s415 1)), p1:(OR (EQ s701 0) (EQ s673 1)), p2:(OR (EQ s747 0) (EQ s485 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 5314 ms.
Product exploration explored 100000 steps with 0 reset in 5693 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 320 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 873 ms. (steps per millisecond=11 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 136881 steps, run timeout after 3004 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136881 steps, saw 132154 distinct states, run finished after 3005 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-22 21:51:21] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2024-05-22 21:51:21] [INFO ] Computed 400 invariants in 3 ms
[2024-05-22 21:51:21] [INFO ] [Real]Absence check using 400 positive place invariants in 55 ms returned sat
[2024-05-22 21:51:21] [INFO ] After 306ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-22 21:51:22] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-22 21:51:22] [INFO ] After 172ms SMT Verify possible using 200 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:51:22] [INFO ] After 919ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:51:22] [INFO ] [Nat]Absence check using 400 positive place invariants in 47 ms returned sat
[2024-05-22 21:51:22] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 21:51:23] [INFO ] After 284ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 21:51:24] [INFO ] Deduced a trap composed of 4 places in 954 ms of which 0 ms to minimize.
[2024-05-22 21:51:25] [INFO ] Deduced a trap composed of 4 places in 990 ms of which 0 ms to minimize.
[2024-05-22 21:51:26] [INFO ] Deduced a trap composed of 4 places in 942 ms of which 0 ms to minimize.
[2024-05-22 21:51:27] [INFO ] Deduced a trap composed of 4 places in 925 ms of which 0 ms to minimize.
[2024-05-22 21:51:28] [INFO ] Deduced a trap composed of 4 places in 934 ms of which 1 ms to minimize.
[2024-05-22 21:51:29] [INFO ] Deduced a trap composed of 4 places in 895 ms of which 0 ms to minimize.
[2024-05-22 21:51:30] [INFO ] Deduced a trap composed of 4 places in 897 ms of which 3 ms to minimize.
[2024-05-22 21:51:31] [INFO ] Deduced a trap composed of 4 places in 894 ms of which 1 ms to minimize.
[2024-05-22 21:51:31] [INFO ] Deduced a trap composed of 4 places in 860 ms of which 1 ms to minimize.
[2024-05-22 21:51:32] [INFO ] Deduced a trap composed of 4 places in 863 ms of which 0 ms to minimize.
[2024-05-22 21:51:33] [INFO ] Deduced a trap composed of 4 places in 861 ms of which 1 ms to minimize.
[2024-05-22 21:51:33] [INFO ] Trap strengthening procedure interrupted after too many repetitions 10407 ms
[2024-05-22 21:51:33] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 10407 ms
[2024-05-22 21:51:34] [INFO ] Deduced a trap composed of 4 places in 860 ms of which 0 ms to minimize.
[2024-05-22 21:51:35] [INFO ] Deduced a trap composed of 4 places in 869 ms of which 1 ms to minimize.
[2024-05-22 21:51:36] [INFO ] Deduced a trap composed of 4 places in 875 ms of which 0 ms to minimize.
[2024-05-22 21:51:37] [INFO ] Deduced a trap composed of 4 places in 866 ms of which 1 ms to minimize.
[2024-05-22 21:51:38] [INFO ] Deduced a trap composed of 4 places in 846 ms of which 1 ms to minimize.
[2024-05-22 21:51:39] [INFO ] Deduced a trap composed of 4 places in 836 ms of which 1 ms to minimize.
[2024-05-22 21:51:39] [INFO ] Deduced a trap composed of 4 places in 815 ms of which 0 ms to minimize.
[2024-05-22 21:51:40] [INFO ] Deduced a trap composed of 4 places in 801 ms of which 1 ms to minimize.
[2024-05-22 21:51:41] [INFO ] Deduced a trap composed of 4 places in 776 ms of which 1 ms to minimize.
[2024-05-22 21:51:42] [INFO ] Deduced a trap composed of 4 places in 819 ms of which 1 ms to minimize.
[2024-05-22 21:51:43] [INFO ] Deduced a trap composed of 4 places in 821 ms of which 2 ms to minimize.
[2024-05-22 21:51:43] [INFO ] Trap strengthening procedure interrupted after too many repetitions 9575 ms
[2024-05-22 21:51:43] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 9576 ms
[2024-05-22 21:51:44] [INFO ] Deduced a trap composed of 4 places in 789 ms of which 0 ms to minimize.
[2024-05-22 21:51:45] [INFO ] Deduced a trap composed of 4 places in 791 ms of which 3 ms to minimize.
[2024-05-22 21:51:45] [INFO ] Deduced a trap composed of 4 places in 793 ms of which 1 ms to minimize.
[2024-05-22 21:51:46] [INFO ] Deduced a trap composed of 4 places in 780 ms of which 0 ms to minimize.
[2024-05-22 21:51:47] [INFO ] Deduced a trap composed of 4 places in 803 ms of which 0 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-22 21:51:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-22 21:51:47] [INFO ] After 25182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 5 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 857 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 858 ms. Remains : 800/800 places, 40400/40400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 688 ms. (steps per millisecond=14 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 21:51:49] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:51:49] [INFO ] Invariant cache hit.
[2024-05-22 21:51:49] [INFO ] [Real]Absence check using 400 positive place invariants in 55 ms returned sat
[2024-05-22 21:51:49] [INFO ] After 359ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-22 21:51:50] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-22 21:51:50] [INFO ] After 173ms SMT Verify possible using 200 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 21:51:50] [INFO ] After 955ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 21:51:50] [INFO ] [Nat]Absence check using 400 positive place invariants in 55 ms returned sat
[2024-05-22 21:51:50] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 21:51:51] [INFO ] After 249ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 21:51:52] [INFO ] Deduced a trap composed of 4 places in 838 ms of which 1 ms to minimize.
[2024-05-22 21:51:52] [INFO ] Deduced a trap composed of 4 places in 854 ms of which 3 ms to minimize.
[2024-05-22 21:51:53] [INFO ] Deduced a trap composed of 4 places in 829 ms of which 0 ms to minimize.
[2024-05-22 21:51:54] [INFO ] Deduced a trap composed of 4 places in 849 ms of which 0 ms to minimize.
[2024-05-22 21:51:55] [INFO ] Deduced a trap composed of 4 places in 823 ms of which 0 ms to minimize.
[2024-05-22 21:51:56] [INFO ] Deduced a trap composed of 4 places in 804 ms of which 0 ms to minimize.
[2024-05-22 21:51:57] [INFO ] Deduced a trap composed of 4 places in 818 ms of which 0 ms to minimize.
[2024-05-22 21:51:58] [INFO ] Deduced a trap composed of 4 places in 774 ms of which 0 ms to minimize.
[2024-05-22 21:51:58] [INFO ] Deduced a trap composed of 4 places in 768 ms of which 0 ms to minimize.
[2024-05-22 21:51:59] [INFO ] Deduced a trap composed of 4 places in 774 ms of which 1 ms to minimize.
[2024-05-22 21:52:00] [INFO ] Deduced a trap composed of 4 places in 772 ms of which 5 ms to minimize.
[2024-05-22 21:52:00] [INFO ] Trap strengthening procedure interrupted after too many repetitions 9247 ms
[2024-05-22 21:52:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 9247 ms
[2024-05-22 21:52:01] [INFO ] Deduced a trap composed of 4 places in 756 ms of which 0 ms to minimize.
[2024-05-22 21:52:02] [INFO ] Deduced a trap composed of 4 places in 726 ms of which 1 ms to minimize.
[2024-05-22 21:52:02] [INFO ] Deduced a trap composed of 4 places in 740 ms of which 3 ms to minimize.
[2024-05-22 21:52:03] [INFO ] Deduced a trap composed of 4 places in 730 ms of which 1 ms to minimize.
[2024-05-22 21:52:04] [INFO ] Deduced a trap composed of 4 places in 731 ms of which 1 ms to minimize.
[2024-05-22 21:52:05] [INFO ] Deduced a trap composed of 4 places in 715 ms of which 1 ms to minimize.
[2024-05-22 21:52:05] [INFO ] Deduced a trap composed of 4 places in 725 ms of which 0 ms to minimize.
[2024-05-22 21:52:06] [INFO ] Deduced a trap composed of 4 places in 690 ms of which 0 ms to minimize.
[2024-05-22 21:52:07] [INFO ] Deduced a trap composed of 4 places in 678 ms of which 1 ms to minimize.
[2024-05-22 21:52:07] [INFO ] Deduced a trap composed of 4 places in 669 ms of which 1 ms to minimize.
[2024-05-22 21:52:08] [INFO ] Deduced a trap composed of 4 places in 661 ms of which 1 ms to minimize.
[2024-05-22 21:52:08] [INFO ] Trap strengthening procedure interrupted after too many repetitions 8198 ms
[2024-05-22 21:52:08] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 8200 ms
[2024-05-22 21:52:08] [INFO ] After 17864ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 104 ms.
[2024-05-22 21:52:08] [INFO ] After 18520ms 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 8 ms.
Support contains 5 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 800 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 800 ms. Remains : 800/800 places, 40400/40400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 696 ms. (steps per millisecond=14 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 172458 steps, run timeout after 3003 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 172458 steps, saw 166319 distinct states, run finished after 3004 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-22 21:52:13] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:52:13] [INFO ] Invariant cache hit.
[2024-05-22 21:52:13] [INFO ] [Real]Absence check using 400 positive place invariants in 52 ms returned sat
[2024-05-22 21:52:14] [INFO ] After 352ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-22 21:52:14] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-22 21:52:14] [INFO ] After 169ms SMT Verify possible using 200 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 21:52:14] [INFO ] After 937ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 21:52:14] [INFO ] [Nat]Absence check using 400 positive place invariants in 53 ms returned sat
[2024-05-22 21:52:14] [INFO ] After 346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 21:52:15] [INFO ] After 249ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 21:52:16] [INFO ] Deduced a trap composed of 4 places in 857 ms of which 0 ms to minimize.
[2024-05-22 21:52:17] [INFO ] Deduced a trap composed of 4 places in 827 ms of which 0 ms to minimize.
[2024-05-22 21:52:17] [INFO ] Deduced a trap composed of 4 places in 842 ms of which 0 ms to minimize.
[2024-05-22 21:52:18] [INFO ] Deduced a trap composed of 4 places in 855 ms of which 0 ms to minimize.
[2024-05-22 21:52:19] [INFO ] Deduced a trap composed of 4 places in 800 ms of which 0 ms to minimize.
[2024-05-22 21:52:20] [INFO ] Deduced a trap composed of 4 places in 793 ms of which 0 ms to minimize.
[2024-05-22 21:52:21] [INFO ] Deduced a trap composed of 4 places in 796 ms of which 1 ms to minimize.
[2024-05-22 21:52:22] [INFO ] Deduced a trap composed of 4 places in 788 ms of which 0 ms to minimize.
[2024-05-22 21:52:22] [INFO ] Deduced a trap composed of 4 places in 771 ms of which 1 ms to minimize.
[2024-05-22 21:52:23] [INFO ] Deduced a trap composed of 4 places in 765 ms of which 1 ms to minimize.
[2024-05-22 21:52:24] [INFO ] Deduced a trap composed of 4 places in 778 ms of which 1 ms to minimize.
[2024-05-22 21:52:24] [INFO ] Trap strengthening procedure interrupted after too many repetitions 9246 ms
[2024-05-22 21:52:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 9246 ms
[2024-05-22 21:52:25] [INFO ] Deduced a trap composed of 4 places in 770 ms of which 1 ms to minimize.
[2024-05-22 21:52:26] [INFO ] Deduced a trap composed of 4 places in 768 ms of which 0 ms to minimize.
[2024-05-22 21:52:26] [INFO ] Deduced a trap composed of 4 places in 744 ms of which 0 ms to minimize.
[2024-05-22 21:52:27] [INFO ] Deduced a trap composed of 4 places in 723 ms of which 0 ms to minimize.
[2024-05-22 21:52:28] [INFO ] Deduced a trap composed of 4 places in 723 ms of which 1 ms to minimize.
[2024-05-22 21:52:29] [INFO ] Deduced a trap composed of 4 places in 711 ms of which 0 ms to minimize.
[2024-05-22 21:52:30] [INFO ] Deduced a trap composed of 4 places in 730 ms of which 0 ms to minimize.
[2024-05-22 21:52:30] [INFO ] Deduced a trap composed of 4 places in 722 ms of which 0 ms to minimize.
[2024-05-22 21:52:31] [INFO ] Deduced a trap composed of 4 places in 703 ms of which 0 ms to minimize.
[2024-05-22 21:52:32] [INFO ] Deduced a trap composed of 4 places in 700 ms of which 0 ms to minimize.
[2024-05-22 21:52:32] [INFO ] Deduced a trap composed of 4 places in 683 ms of which 2 ms to minimize.
[2024-05-22 21:52:32] [INFO ] Trap strengthening procedure interrupted after too many repetitions 8350 ms
[2024-05-22 21:52:32] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 8350 ms
[2024-05-22 21:52:32] [INFO ] After 18011ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 113 ms.
[2024-05-22 21:52:33] [INFO ] After 18701ms 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 7 ms.
Support contains 5 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 1113 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1114 ms. Remains : 800/800 places, 40400/40400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 1060 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 21:52:35] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:52:35] [INFO ] Invariant cache hit.
[2024-05-22 21:52:41] [INFO ] Implicit Places using invariants in 6414 ms returned []
Implicit Place search using SMT only with invariants took 6416 ms to find 0 implicit places.
[2024-05-22 21:52:41] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:52:41] [INFO ] Invariant cache hit.
[2024-05-22 21:52:54] [INFO ] Dead Transitions using invariants and state equation in 12799 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20282 ms. Remains : 800/800 places, 40400/40400 transitions.
Graph (complete) has 1200 edges and 800 vertex of which 20 are kept as prefixes of interest. Removing 780 places using SCC suffix rule.4 ms
Discarding 780 places :
Also discarding 39390 output transitions
Drop transitions removed 39390 transitions
Ensure Unique test removed 990 transitions
Reduce isomorphic transitions removed 990 transitions.
Iterating post reduction 0 with 990 rules applied. Total rules applied 991 place count 20 transition count 20
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 1006 place count 10 transition count 15
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 1011 place count 10 transition count 10
Applied a total of 1011 rules in 29 ms. Remains 10 /800 variables (removed 790) and now considering 10/40400 (removed 40390) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 10 rows 10 cols
[2024-05-22 21:52:54] [INFO ] Computed 5 invariants in 1 ms
[2024-05-22 21:52:54] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 21:52:54] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-22 21:52:54] [INFO ] After 9ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 21:52:54] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 21:52:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 21:52:54] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 21:52:54] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-22 21:52:54] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (AND p1 p0 (NOT p2)))]
Knowledge based reduction with 7 factoid took 227 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 1422 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 21:52:56] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2024-05-22 21:52:56] [INFO ] Computed 400 invariants in 6 ms
[2024-05-22 21:53:02] [INFO ] Implicit Places using invariants in 6234 ms returned []
Implicit Place search using SMT only with invariants took 6236 ms to find 0 implicit places.
[2024-05-22 21:53:02] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:53:02] [INFO ] Invariant cache hit.
[2024-05-22 21:53:15] [INFO ] Dead Transitions using invariants and state equation in 12753 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20413 ms. Remains : 800/800 places, 40400/40400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 200 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 686 ms. (steps per millisecond=14 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 142308 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142308 steps, saw 137382 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-22 21:53:20] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:53:20] [INFO ] Invariant cache hit.
[2024-05-22 21:53:20] [INFO ] [Real]Absence check using 400 positive place invariants in 54 ms returned sat
[2024-05-22 21:53:20] [INFO ] After 289ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-22 21:53:21] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-22 21:53:21] [INFO ] After 173ms SMT Verify possible using 200 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:53:21] [INFO ] After 888ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:53:21] [INFO ] [Nat]Absence check using 400 positive place invariants in 53 ms returned sat
[2024-05-22 21:53:21] [INFO ] After 372ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 21:53:22] [INFO ] After 280ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 21:53:23] [INFO ] Deduced a trap composed of 4 places in 869 ms of which 0 ms to minimize.
[2024-05-22 21:53:24] [INFO ] Deduced a trap composed of 4 places in 857 ms of which 0 ms to minimize.
[2024-05-22 21:53:24] [INFO ] Deduced a trap composed of 4 places in 845 ms of which 0 ms to minimize.
[2024-05-22 21:53:25] [INFO ] Deduced a trap composed of 4 places in 866 ms of which 1 ms to minimize.
[2024-05-22 21:53:26] [INFO ] Deduced a trap composed of 4 places in 837 ms of which 0 ms to minimize.
[2024-05-22 21:53:27] [INFO ] Deduced a trap composed of 4 places in 813 ms of which 0 ms to minimize.
[2024-05-22 21:53:28] [INFO ] Deduced a trap composed of 4 places in 807 ms of which 1 ms to minimize.
[2024-05-22 21:53:29] [INFO ] Deduced a trap composed of 4 places in 788 ms of which 0 ms to minimize.
[2024-05-22 21:53:30] [INFO ] Deduced a trap composed of 4 places in 799 ms of which 0 ms to minimize.
[2024-05-22 21:53:30] [INFO ] Deduced a trap composed of 4 places in 819 ms of which 0 ms to minimize.
[2024-05-22 21:53:31] [INFO ] Deduced a trap composed of 4 places in 809 ms of which 0 ms to minimize.
[2024-05-22 21:53:31] [INFO ] Trap strengthening procedure interrupted after too many repetitions 9473 ms
[2024-05-22 21:53:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 9474 ms
[2024-05-22 21:53:32] [INFO ] Deduced a trap composed of 4 places in 789 ms of which 0 ms to minimize.
[2024-05-22 21:53:33] [INFO ] Deduced a trap composed of 4 places in 794 ms of which 0 ms to minimize.
[2024-05-22 21:53:34] [INFO ] Deduced a trap composed of 4 places in 799 ms of which 0 ms to minimize.
[2024-05-22 21:53:35] [INFO ] Deduced a trap composed of 4 places in 770 ms of which 1 ms to minimize.
[2024-05-22 21:53:35] [INFO ] Deduced a trap composed of 4 places in 755 ms of which 0 ms to minimize.
[2024-05-22 21:53:36] [INFO ] Deduced a trap composed of 4 places in 768 ms of which 1 ms to minimize.
[2024-05-22 21:53:37] [INFO ] Deduced a trap composed of 4 places in 751 ms of which 0 ms to minimize.
[2024-05-22 21:53:38] [INFO ] Deduced a trap composed of 4 places in 760 ms of which 0 ms to minimize.
[2024-05-22 21:53:39] [INFO ] Deduced a trap composed of 4 places in 736 ms of which 1 ms to minimize.
[2024-05-22 21:53:39] [INFO ] Deduced a trap composed of 4 places in 720 ms of which 0 ms to minimize.
[2024-05-22 21:53:40] [INFO ] Deduced a trap composed of 4 places in 710 ms of which 1 ms to minimize.
[2024-05-22 21:53:40] [INFO ] Trap strengthening procedure interrupted after too many repetitions 8710 ms
[2024-05-22 21:53:40] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 8710 ms
[2024-05-22 21:53:41] [INFO ] Deduced a trap composed of 4 places in 716 ms of which 0 ms to minimize.
[2024-05-22 21:53:41] [INFO ] Deduced a trap composed of 4 places in 693 ms of which 0 ms to minimize.
[2024-05-22 21:53:42] [INFO ] Deduced a trap composed of 4 places in 682 ms of which 1 ms to minimize.
[2024-05-22 21:53:43] [INFO ] Deduced a trap composed of 4 places in 684 ms of which 0 ms to minimize.
[2024-05-22 21:53:44] [INFO ] Deduced a trap composed of 4 places in 663 ms of which 1 ms to minimize.
[2024-05-22 21:53:44] [INFO ] Deduced a trap composed of 4 places in 662 ms of which 0 ms to minimize.
[2024-05-22 21:53:45] [INFO ] Deduced a trap composed of 4 places in 651 ms of which 1 ms to minimize.
[2024-05-22 21:53:46] [INFO ] Deduced a trap composed of 4 places in 662 ms of which 0 ms to minimize.
[2024-05-22 21:53:46] [INFO ] Deduced a trap composed of 4 places in 651 ms of which 0 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-22 21:53:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-22 21:53:46] [INFO ] After 25586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 845 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 846 ms. Remains : 800/800 places, 40400/40400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 656 ms. (steps per millisecond=15 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 147534 steps, run timeout after 3002 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147534 steps, saw 142405 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-22 21:53:51] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:53:51] [INFO ] Invariant cache hit.
[2024-05-22 21:53:51] [INFO ] [Real]Absence check using 400 positive place invariants in 56 ms returned sat
[2024-05-22 21:53:52] [INFO ] After 306ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-22 21:53:52] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-22 21:53:52] [INFO ] After 170ms SMT Verify possible using 200 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:53:52] [INFO ] After 888ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:53:52] [INFO ] [Nat]Absence check using 400 positive place invariants in 53 ms returned sat
[2024-05-22 21:53:53] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 21:53:53] [INFO ] After 274ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 21:53:54] [INFO ] Deduced a trap composed of 4 places in 858 ms of which 1 ms to minimize.
[2024-05-22 21:53:55] [INFO ] Deduced a trap composed of 4 places in 879 ms of which 0 ms to minimize.
[2024-05-22 21:53:56] [INFO ] Deduced a trap composed of 4 places in 848 ms of which 1 ms to minimize.
[2024-05-22 21:53:57] [INFO ] Deduced a trap composed of 4 places in 841 ms of which 1 ms to minimize.
[2024-05-22 21:53:57] [INFO ] Deduced a trap composed of 4 places in 844 ms of which 0 ms to minimize.
[2024-05-22 21:53:58] [INFO ] Deduced a trap composed of 4 places in 817 ms of which 0 ms to minimize.
[2024-05-22 21:53:59] [INFO ] Deduced a trap composed of 4 places in 793 ms of which 0 ms to minimize.
[2024-05-22 21:54:00] [INFO ] Deduced a trap composed of 4 places in 798 ms of which 0 ms to minimize.
[2024-05-22 21:54:01] [INFO ] Deduced a trap composed of 4 places in 781 ms of which 0 ms to minimize.
[2024-05-22 21:54:02] [INFO ] Deduced a trap composed of 4 places in 820 ms of which 2 ms to minimize.
[2024-05-22 21:54:02] [INFO ] Deduced a trap composed of 4 places in 836 ms of which 1 ms to minimize.
[2024-05-22 21:54:02] [INFO ] Trap strengthening procedure interrupted after too many repetitions 9484 ms
[2024-05-22 21:54:02] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 9484 ms
[2024-05-22 21:54:03] [INFO ] Deduced a trap composed of 4 places in 796 ms of which 0 ms to minimize.
[2024-05-22 21:54:04] [INFO ] Deduced a trap composed of 4 places in 801 ms of which 0 ms to minimize.
[2024-05-22 21:54:05] [INFO ] Deduced a trap composed of 4 places in 762 ms of which 0 ms to minimize.
[2024-05-22 21:54:06] [INFO ] Deduced a trap composed of 4 places in 771 ms of which 0 ms to minimize.
[2024-05-22 21:54:07] [INFO ] Deduced a trap composed of 4 places in 768 ms of which 1 ms to minimize.
[2024-05-22 21:54:07] [INFO ] Deduced a trap composed of 4 places in 757 ms of which 0 ms to minimize.
[2024-05-22 21:54:08] [INFO ] Deduced a trap composed of 4 places in 754 ms of which 0 ms to minimize.
[2024-05-22 21:54:09] [INFO ] Deduced a trap composed of 4 places in 732 ms of which 0 ms to minimize.
[2024-05-22 21:54:10] [INFO ] Deduced a trap composed of 4 places in 742 ms of which 0 ms to minimize.
[2024-05-22 21:54:11] [INFO ] Deduced a trap composed of 4 places in 748 ms of which 0 ms to minimize.
[2024-05-22 21:54:11] [INFO ] Deduced a trap composed of 4 places in 719 ms of which 0 ms to minimize.
[2024-05-22 21:54:11] [INFO ] Trap strengthening procedure interrupted after too many repetitions 8730 ms
[2024-05-22 21:54:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 8730 ms
[2024-05-22 21:54:12] [INFO ] Deduced a trap composed of 4 places in 717 ms of which 1 ms to minimize.
[2024-05-22 21:54:13] [INFO ] Deduced a trap composed of 4 places in 707 ms of which 1 ms to minimize.
[2024-05-22 21:54:14] [INFO ] Deduced a trap composed of 4 places in 734 ms of which 0 ms to minimize.
[2024-05-22 21:54:14] [INFO ] Deduced a trap composed of 4 places in 696 ms of which 0 ms to minimize.
[2024-05-22 21:54:15] [INFO ] Deduced a trap composed of 4 places in 678 ms of which 0 ms to minimize.
[2024-05-22 21:54:16] [INFO ] Deduced a trap composed of 4 places in 667 ms of which 0 ms to minimize.
[2024-05-22 21:54:16] [INFO ] Deduced a trap composed of 4 places in 669 ms of which 0 ms to minimize.
[2024-05-22 21:54:17] [INFO ] Deduced a trap composed of 4 places in 647 ms of which 0 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-22 21:54:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-22 21:54:17] [INFO ] After 25077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 852 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 852 ms. Remains : 800/800 places, 40400/40400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 1028 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 21:54:19] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:54:19] [INFO ] Invariant cache hit.
[2024-05-22 21:54:25] [INFO ] Implicit Places using invariants in 6125 ms returned []
Implicit Place search using SMT only with invariants took 6126 ms to find 0 implicit places.
[2024-05-22 21:54:25] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:54:25] [INFO ] Invariant cache hit.
[2024-05-22 21:54:38] [INFO ] Dead Transitions using invariants and state equation in 12472 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19631 ms. Remains : 800/800 places, 40400/40400 transitions.
Graph (complete) has 1200 edges and 800 vertex of which 20 are kept as prefixes of interest. Removing 780 places using SCC suffix rule.3 ms
Discarding 780 places :
Also discarding 39390 output transitions
Drop transitions removed 39390 transitions
Ensure Unique test removed 990 transitions
Reduce isomorphic transitions removed 990 transitions.
Iterating post reduction 0 with 990 rules applied. Total rules applied 991 place count 20 transition count 20
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 1006 place count 10 transition count 15
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 1011 place count 10 transition count 10
Applied a total of 1011 rules in 29 ms. Remains 10 /800 variables (removed 790) and now considering 10/40400 (removed 40390) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 10 rows 10 cols
[2024-05-22 21:54:38] [INFO ] Computed 5 invariants in 1 ms
[2024-05-22 21:54:38] [INFO ] [Real]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-05-22 21:54:38] [INFO ] After 6ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-22 21:54:38] [INFO ] After 8ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-22 21:54:38] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 21:54:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 21:54:38] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 21:54:38] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-22 21:54:38] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 221 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 0 reset in 5442 ms.
Product exploration explored 100000 steps with 0 reset in 5694 ms.
Built C files in :
/tmp/ltsmin10908069410911395806
[2024-05-22 21:54:49] [INFO ] Too many transitions (40400) to apply POR reductions. Disabling POR matrices.
[2024-05-22 21:54:50] [INFO ] Built C files in 417ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10908069410911395806
Running compilation step : cd /tmp/ltsmin10908069410911395806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10908069410911395806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10908069410911395806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 1462 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 21:54:54] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2024-05-22 21:54:54] [INFO ] Computed 400 invariants in 6 ms
[2024-05-22 21:55:01] [INFO ] Implicit Places using invariants in 6358 ms returned []
Implicit Place search using SMT only with invariants took 6359 ms to find 0 implicit places.
[2024-05-22 21:55:01] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:55:01] [INFO ] Invariant cache hit.
[2024-05-22 21:55:14] [INFO ] Dead Transitions using invariants and state equation in 13146 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20969 ms. Remains : 800/800 places, 40400/40400 transitions.
Built C files in :
/tmp/ltsmin11086785475865411837
[2024-05-22 21:55:14] [INFO ] Too many transitions (40400) to apply POR reductions. Disabling POR matrices.
[2024-05-22 21:55:14] [INFO ] Built C files in 307ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11086785475865411837
Running compilation step : cd /tmp/ltsmin11086785475865411837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11086785475865411837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11086785475865411837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 21:55:20] [INFO ] Flatten gal took : 1313 ms
[2024-05-22 21:55:21] [INFO ] Flatten gal took : 1281 ms
[2024-05-22 21:55:21] [INFO ] Time to serialize gal into /tmp/LTL10549661916700038944.gal : 205 ms
[2024-05-22 21:55:21] [INFO ] Time to serialize properties into /tmp/LTL18279144130015814747.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10549661916700038944.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3704975968958436970.hoa' '-atoms' '/tmp/LTL18279144130015814747.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18279144130015814747.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3704975968958436970.hoa
Detected timeout of ITS tools.
[2024-05-22 21:55:38] [INFO ] Flatten gal took : 1337 ms
[2024-05-22 21:55:40] [INFO ] Flatten gal took : 1248 ms
[2024-05-22 21:55:40] [INFO ] Time to serialize gal into /tmp/LTL17227037699248971052.gal : 190 ms
[2024-05-22 21:55:40] [INFO ] Time to serialize properties into /tmp/LTL2711567263355449033.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17227037699248971052.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2711567263355449033.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("(((p3_150==0)||(p3_136==1))||(p3_7==1))")&&(("((p3_150==0)||(p3_136==1))")||(F("((p3_173==0)||(p3_42==1))")))))))
Formula 0 simplified : GF(!"(((p3_150==0)||(p3_136==1))||(p3_7==1))" | (!"((p3_150==0)||(p3_136==1))" & G!"((p3_173==0)||(p3_42==1))"))
Detected timeout of ITS tools.
[2024-05-22 21:55:56] [INFO ] Flatten gal took : 1292 ms
[2024-05-22 21:55:56] [INFO ] Applying decomposition
[2024-05-22 21:55:58] [INFO ] Flatten gal took : 1236 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7489975192496243993.txt' '-o' '/tmp/graph7489975192496243993.bin' '-w' '/tmp/graph7489975192496243993.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7489975192496243993.bin' '-l' '-1' '-v' '-w' '/tmp/graph7489975192496243993.weights' '-q' '0' '-e' '0.001'
[2024-05-22 21:56:00] [INFO ] Decomposing Gal with order
[2024-05-22 21:56:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 21:56:04] [INFO ] Removed a total of 118800 redundant transitions.
[2024-05-22 21:56:04] [INFO ] Flatten gal took : 2379 ms
[2024-05-22 21:56:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 925 ms.
[2024-05-22 21:56:05] [INFO ] Time to serialize gal into /tmp/LTL10558279873796471442.gal : 134 ms
[2024-05-22 21:56:05] [INFO ] Time to serialize properties into /tmp/LTL15110352524096428345.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10558279873796471442.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15110352524096428345.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3483431894652995645
[2024-05-22 21:56:21] [INFO ] Built C files in 273ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3483431894652995645
Running compilation step : cd /tmp/ltsmin3483431894652995645;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3483431894652995645;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3483431894652995645;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Dekker-PT-200-LTLCardinality-06 finished in 328708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 1437 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 21:56:25] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 803 cols
[2024-05-22 21:56:25] [INFO ] Computed 403 invariants in 7 ms
[2024-05-22 21:56:32] [INFO ] Implicit Places using invariants in 6765 ms returned [422, 753, 786]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 6800 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 800/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 1525 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9764 ms. Remains : 800/803 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-200-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s97 0) (EQ s757 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 5577 ms.
Stack based approach found an accepted trace after 659 steps with 0 reset with depth 660 and stack size 657 in 39 ms.
FORMULA Dekker-PT-200-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-200-LTLCardinality-07 finished in 15518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 678 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 21:56:40] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:56:40] [INFO ] Invariant cache hit.
[2024-05-22 21:56:46] [INFO ] Implicit Places using invariants in 6600 ms returned [753, 786]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 6629 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 801/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 748 ms. Remains 801 /801 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8056 ms. Remains : 801/803 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-200-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s88 0) (EQ s422 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 5434 ms.
Stack based approach found an accepted trace after 781 steps with 223 reset with depth 5 and stack size 5 in 42 ms.
FORMULA Dekker-PT-200-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-200-LTLCardinality-11 finished in 13699 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&(p1||F(p2))))))'
Support contains 2 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 672 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 21:56:54] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:56:54] [INFO ] Invariant cache hit.
[2024-05-22 21:57:00] [INFO ] Implicit Places using invariants in 6633 ms returned [422, 753, 786]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 6662 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 800/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 754 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8090 ms. Remains : 800/803 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Dekker-PT-200-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s410 0), p2:(EQ s334 0), p0:(EQ s410 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 483 reset in 5283 ms.
Stack based approach found an accepted trace after 41 steps with 0 reset with depth 42 and stack size 42 in 4 ms.
FORMULA Dekker-PT-200-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-200-LTLCardinality-12 finished in 13664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&G(p1)))'
Support contains 3 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 670 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 21:57:07] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:57:07] [INFO ] Invariant cache hit.
[2024-05-22 21:57:14] [INFO ] Implicit Places using invariants in 6545 ms returned [422, 753, 786]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 6575 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 800/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 703 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7949 ms. Remains : 800/803 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Dekker-PT-200-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (EQ s571 0) (EQ s194 1)), p0:(EQ s291 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 5430 ms.
Product exploration explored 100000 steps with 0 reset in 5717 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 266 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 561 ms. (steps per millisecond=17 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 21:57:27] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2024-05-22 21:57:27] [INFO ] Computed 400 invariants in 6 ms
[2024-05-22 21:57:28] [INFO ] [Real]Absence check using 400 positive place invariants in 49 ms returned sat
[2024-05-22 21:57:28] [INFO ] After 454ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 21:57:28] [INFO ] [Nat]Absence check using 400 positive place invariants in 53 ms returned sat
[2024-05-22 21:57:28] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 21:57:29] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-22 21:57:29] [INFO ] After 178ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 21:57:29] [INFO ] After 314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-22 21:57:29] [INFO ] After 1003ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 831 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 832 ms. Remains : 800/800 places, 40400/40400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 555 ms. (steps per millisecond=18 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 251652 steps, run timeout after 3002 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 251652 steps, saw 242200 distinct states, run finished after 3002 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 21:57:33] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:57:33] [INFO ] Invariant cache hit.
[2024-05-22 21:57:34] [INFO ] [Real]Absence check using 400 positive place invariants in 54 ms returned sat
[2024-05-22 21:57:34] [INFO ] After 462ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 21:57:34] [INFO ] [Nat]Absence check using 400 positive place invariants in 54 ms returned sat
[2024-05-22 21:57:34] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 21:57:35] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-22 21:57:35] [INFO ] After 178ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 21:57:35] [INFO ] After 287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2024-05-22 21:57:35] [INFO ] After 977ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 933 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 933 ms. Remains : 800/800 places, 40400/40400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 940 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 21:57:37] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:57:37] [INFO ] Invariant cache hit.
[2024-05-22 21:57:43] [INFO ] Implicit Places using invariants in 6315 ms returned []
Implicit Place search using SMT only with invariants took 6316 ms to find 0 implicit places.
[2024-05-22 21:57:43] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:57:43] [INFO ] Invariant cache hit.
[2024-05-22 21:57:56] [INFO ] Dead Transitions using invariants and state equation in 13031 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20292 ms. Remains : 800/800 places, 40400/40400 transitions.
Graph (complete) has 1200 edges and 800 vertex of which 8 are kept as prefixes of interest. Removing 792 places using SCC suffix rule.3 ms
Discarding 792 places :
Also discarding 39996 output transitions
Drop transitions removed 39996 transitions
Ensure Unique test removed 396 transitions
Reduce isomorphic transitions removed 396 transitions.
Iterating post reduction 0 with 396 rules applied. Total rules applied 397 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 400 place count 6 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 401 place count 6 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 402 place count 6 transition count 5
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 405 place count 4 transition count 4
Applied a total of 405 rules in 19 ms. Remains 4 /800 variables (removed 796) and now considering 4/40400 (removed 40396) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2024-05-22 21:57:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 21:57:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 21:57:56] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 21:57:56] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-22 21:57:56] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 4 factoid took 310 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Support contains 3 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 743 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 21:57:58] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2024-05-22 21:57:58] [INFO ] Computed 400 invariants in 5 ms
[2024-05-22 21:58:04] [INFO ] Implicit Places using invariants in 6435 ms returned []
Implicit Place search using SMT only with invariants took 6436 ms to find 0 implicit places.
[2024-05-22 21:58:04] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:58:04] [INFO ] Invariant cache hit.
[2024-05-22 21:58:17] [INFO ] Dead Transitions using invariants and state equation in 13115 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20295 ms. Remains : 800/800 places, 40400/40400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 4 factoid took 253 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 642 ms. (steps per millisecond=15 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 21:58:19] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:58:19] [INFO ] Invariant cache hit.
[2024-05-22 21:58:19] [INFO ] [Real]Absence check using 400 positive place invariants in 56 ms returned sat
[2024-05-22 21:58:19] [INFO ] After 502ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 21:58:20] [INFO ] [Nat]Absence check using 400 positive place invariants in 54 ms returned sat
[2024-05-22 21:58:20] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 21:58:20] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-22 21:58:20] [INFO ] After 198ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 21:58:20] [INFO ] After 315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-22 21:58:20] [INFO ] After 1075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 840 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 842 ms. Remains : 800/800 places, 40400/40400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 565 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 243813 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 243813 steps, saw 234727 distinct states, run finished after 3002 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 21:58:25] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:58:25] [INFO ] Invariant cache hit.
[2024-05-22 21:58:25] [INFO ] [Real]Absence check using 400 positive place invariants in 51 ms returned sat
[2024-05-22 21:58:25] [INFO ] After 466ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 21:58:26] [INFO ] [Nat]Absence check using 400 positive place invariants in 51 ms returned sat
[2024-05-22 21:58:26] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 21:58:26] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-22 21:58:26] [INFO ] After 175ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 21:58:26] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-22 21:58:26] [INFO ] After 979ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 1045 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1045 ms. Remains : 800/800 places, 40400/40400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 1010 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 21:58:28] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:58:28] [INFO ] Invariant cache hit.
[2024-05-22 21:58:35] [INFO ] Implicit Places using invariants in 6342 ms returned []
Implicit Place search using SMT only with invariants took 6348 ms to find 0 implicit places.
[2024-05-22 21:58:35] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:58:35] [INFO ] Invariant cache hit.
[2024-05-22 21:58:48] [INFO ] Dead Transitions using invariants and state equation in 12868 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20233 ms. Remains : 800/800 places, 40400/40400 transitions.
Graph (complete) has 1200 edges and 800 vertex of which 8 are kept as prefixes of interest. Removing 792 places using SCC suffix rule.3 ms
Discarding 792 places :
Also discarding 39996 output transitions
Drop transitions removed 39996 transitions
Ensure Unique test removed 396 transitions
Reduce isomorphic transitions removed 396 transitions.
Iterating post reduction 0 with 396 rules applied. Total rules applied 397 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 400 place count 6 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 401 place count 6 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 402 place count 6 transition count 5
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 405 place count 4 transition count 4
Applied a total of 405 rules in 21 ms. Remains 4 /800 variables (removed 796) and now considering 4/40400 (removed 40396) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2024-05-22 21:58:48] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 21:58:48] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 21:58:48] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 21:58:48] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-22 21:58:48] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 4 factoid took 308 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Product exploration explored 100000 steps with 0 reset in 5470 ms.
Product exploration explored 100000 steps with 0 reset in 5616 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Support contains 3 out of 800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 1674 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 21:59:02] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2024-05-22 21:59:02] [INFO ] Computed 400 invariants in 3 ms
[2024-05-22 21:59:15] [INFO ] Dead Transitions using invariants and state equation in 13231 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14906 ms. Remains : 800/800 places, 40400/40400 transitions.
Built C files in :
/tmp/ltsmin14481925868292707677
[2024-05-22 21:59:15] [INFO ] Built C files in 271ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14481925868292707677
Running compilation step : cd /tmp/ltsmin14481925868292707677;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14481925868292707677;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14481925868292707677;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 833 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 21:59:19] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:59:19] [INFO ] Invariant cache hit.
[2024-05-22 21:59:26] [INFO ] Implicit Places using invariants in 6646 ms returned []
Implicit Place search using SMT only with invariants took 6647 ms to find 0 implicit places.
[2024-05-22 21:59:26] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 21:59:26] [INFO ] Invariant cache hit.
[2024-05-22 21:59:39] [INFO ] Dead Transitions using invariants and state equation in 12828 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20310 ms. Remains : 800/800 places, 40400/40400 transitions.
Built C files in :
/tmp/ltsmin5462943998772532223
[2024-05-22 21:59:39] [INFO ] Built C files in 251ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5462943998772532223
Running compilation step : cd /tmp/ltsmin5462943998772532223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5462943998772532223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5462943998772532223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 21:59:44] [INFO ] Flatten gal took : 1413 ms
[2024-05-22 21:59:46] [INFO ] Flatten gal took : 1315 ms
[2024-05-22 21:59:46] [INFO ] Time to serialize gal into /tmp/LTL6866147340704912385.gal : 166 ms
[2024-05-22 21:59:46] [INFO ] Time to serialize properties into /tmp/LTL16037029466795674624.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6866147340704912385.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12950084105980293660.hoa' '-atoms' '/tmp/LTL16037029466795674624.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16037029466795674624.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12950084105980293660.hoa
Detected timeout of ITS tools.
[2024-05-22 22:00:03] [INFO ] Flatten gal took : 1274 ms
[2024-05-22 22:00:04] [INFO ] Flatten gal took : 1482 ms
[2024-05-22 22:00:05] [INFO ] Time to serialize gal into /tmp/LTL10947402134025011531.gal : 193 ms
[2024-05-22 22:00:05] [INFO ] Time to serialize properties into /tmp/LTL8971011714521473136.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10947402134025011531.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8971011714521473136.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(F("(flag_1_145==0)")))&&(G("((p3_85==0)||(flag_0_97==1))"))))
Formula 0 simplified : XG!"(flag_1_145==0)" | F!"((p3_85==0)||(flag_0_97==1))"
Detected timeout of ITS tools.
[2024-05-22 22:00:21] [INFO ] Flatten gal took : 1228 ms
[2024-05-22 22:00:21] [INFO ] Applying decomposition
[2024-05-22 22:00:22] [INFO ] Flatten gal took : 1235 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7971936282018658878.txt' '-o' '/tmp/graph7971936282018658878.bin' '-w' '/tmp/graph7971936282018658878.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7971936282018658878.bin' '-l' '-1' '-v' '-w' '/tmp/graph7971936282018658878.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:00:25] [INFO ] Decomposing Gal with order
[2024-05-22 22:00:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:00:27] [INFO ] Removed a total of 118800 redundant transitions.
[2024-05-22 22:00:28] [INFO ] Flatten gal took : 1814 ms
[2024-05-22 22:00:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 745 ms.
[2024-05-22 22:00:29] [INFO ] Time to serialize gal into /tmp/LTL8987024043511703302.gal : 110 ms
[2024-05-22 22:00:29] [INFO ] Time to serialize properties into /tmp/LTL9738789887707548891.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8987024043511703302.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9738789887707548891.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2623116630908734887
[2024-05-22 22:00:44] [INFO ] Built C files in 259ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2623116630908734887
Running compilation step : cd /tmp/ltsmin2623116630908734887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2623116630908734887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2623116630908734887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Dekker-PT-200-LTLCardinality-13 finished in 220531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 645 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 22:00:48] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 803 cols
[2024-05-22 22:00:48] [INFO ] Computed 403 invariants in 5 ms
[2024-05-22 22:00:55] [INFO ] Implicit Places using invariants in 6946 ms returned [422, 753, 786]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 6979 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 800/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 751 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8377 ms. Remains : 800/803 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-200-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s634 0) (NEQ s225 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-200-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-200-LTLCardinality-14 finished in 8554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(F(p2)||p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&G(p1)))'
Found a Shortening insensitive property : Dekker-PT-200-LTLCardinality-13
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Support contains 3 out of 803 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 1406 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 22:00:57] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 22:00:57] [INFO ] Invariant cache hit.
[2024-05-22 22:01:04] [INFO ] Implicit Places using invariants in 6540 ms returned [422, 753, 786]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 6568 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 800/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 1406 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 9381 ms. Remains : 800/803 places, 40400/40400 transitions.
Running random walk in product with property : Dekker-PT-200-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (EQ s571 0) (EQ s194 1)), p0:(EQ s291 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 5263 ms.
Product exploration explored 100000 steps with 0 reset in 5639 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 239 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 579 ms. (steps per millisecond=17 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 22:01:18] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2024-05-22 22:01:18] [INFO ] Computed 400 invariants in 4 ms
[2024-05-22 22:01:18] [INFO ] [Real]Absence check using 400 positive place invariants in 55 ms returned sat
[2024-05-22 22:01:18] [INFO ] After 464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 22:01:19] [INFO ] [Nat]Absence check using 400 positive place invariants in 53 ms returned sat
[2024-05-22 22:01:19] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 22:01:19] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-22 22:01:19] [INFO ] After 168ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 22:01:19] [INFO ] After 282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-22 22:01:19] [INFO ] After 974ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 782 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 783 ms. Remains : 800/800 places, 40400/40400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 554 ms. (steps per millisecond=18 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 246024 steps, run timeout after 3003 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 246024 steps, saw 236827 distinct states, run finished after 3003 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 22:01:24] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 22:01:24] [INFO ] Invariant cache hit.
[2024-05-22 22:01:24] [INFO ] [Real]Absence check using 400 positive place invariants in 51 ms returned sat
[2024-05-22 22:01:24] [INFO ] After 454ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 22:01:24] [INFO ] [Nat]Absence check using 400 positive place invariants in 53 ms returned sat
[2024-05-22 22:01:25] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 22:01:25] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-22 22:01:25] [INFO ] After 170ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 22:01:25] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-22 22:01:25] [INFO ] After 972ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 817 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 817 ms. Remains : 800/800 places, 40400/40400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 804 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 22:01:27] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 22:01:27] [INFO ] Invariant cache hit.
[2024-05-22 22:01:33] [INFO ] Implicit Places using invariants in 6287 ms returned []
Implicit Place search using SMT only with invariants took 6288 ms to find 0 implicit places.
[2024-05-22 22:01:33] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 22:01:33] [INFO ] Invariant cache hit.
[2024-05-22 22:01:46] [INFO ] Dead Transitions using invariants and state equation in 12749 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19845 ms. Remains : 800/800 places, 40400/40400 transitions.
Graph (complete) has 1200 edges and 800 vertex of which 8 are kept as prefixes of interest. Removing 792 places using SCC suffix rule.4 ms
Discarding 792 places :
Also discarding 39996 output transitions
Drop transitions removed 39996 transitions
Ensure Unique test removed 396 transitions
Reduce isomorphic transitions removed 396 transitions.
Iterating post reduction 0 with 396 rules applied. Total rules applied 397 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 400 place count 6 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 401 place count 6 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 402 place count 6 transition count 5
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 405 place count 4 transition count 4
Applied a total of 405 rules in 22 ms. Remains 4 /800 variables (removed 796) and now considering 4/40400 (removed 40396) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2024-05-22 22:01:46] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 22:01:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 22:01:46] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 22:01:46] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-22 22:01:46] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 4 factoid took 286 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Support contains 3 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 664 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 22:01:47] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2024-05-22 22:01:47] [INFO ] Computed 400 invariants in 4 ms
[2024-05-22 22:01:54] [INFO ] Implicit Places using invariants in 6304 ms returned []
Implicit Place search using SMT only with invariants took 6305 ms to find 0 implicit places.
[2024-05-22 22:01:54] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 22:01:54] [INFO ] Invariant cache hit.
[2024-05-22 22:02:06] [INFO ] Dead Transitions using invariants and state equation in 12978 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19948 ms. Remains : 800/800 places, 40400/40400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 4 factoid took 249 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 547 ms. (steps per millisecond=18 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 22:02:08] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 22:02:08] [INFO ] Invariant cache hit.
[2024-05-22 22:02:08] [INFO ] [Real]Absence check using 400 positive place invariants in 52 ms returned sat
[2024-05-22 22:02:09] [INFO ] After 463ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 22:02:09] [INFO ] [Nat]Absence check using 400 positive place invariants in 52 ms returned sat
[2024-05-22 22:02:09] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 22:02:09] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-22 22:02:09] [INFO ] After 164ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 22:02:10] [INFO ] After 265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-22 22:02:10] [INFO ] After 944ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 733 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 733 ms. Remains : 800/800 places, 40400/40400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 570 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 243612 steps, run timeout after 3002 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 243612 steps, saw 234534 distinct states, run finished after 3002 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 22:02:14] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 22:02:14] [INFO ] Invariant cache hit.
[2024-05-22 22:02:14] [INFO ] [Real]Absence check using 400 positive place invariants in 54 ms returned sat
[2024-05-22 22:02:15] [INFO ] After 515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 22:02:15] [INFO ] [Nat]Absence check using 400 positive place invariants in 51 ms returned sat
[2024-05-22 22:02:15] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 22:02:15] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-22 22:02:15] [INFO ] After 177ms SMT Verify possible using 200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 22:02:15] [INFO ] After 279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-22 22:02:15] [INFO ] After 967ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 798 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 799 ms. Remains : 800/800 places, 40400/40400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 826 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 22:02:17] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 22:02:17] [INFO ] Invariant cache hit.
[2024-05-22 22:02:23] [INFO ] Implicit Places using invariants in 6331 ms returned []
Implicit Place search using SMT only with invariants took 6332 ms to find 0 implicit places.
[2024-05-22 22:02:23] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 22:02:23] [INFO ] Invariant cache hit.
[2024-05-22 22:02:36] [INFO ] Dead Transitions using invariants and state equation in 12835 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19997 ms. Remains : 800/800 places, 40400/40400 transitions.
Graph (complete) has 1200 edges and 800 vertex of which 8 are kept as prefixes of interest. Removing 792 places using SCC suffix rule.4 ms
Discarding 792 places :
Also discarding 39996 output transitions
Drop transitions removed 39996 transitions
Ensure Unique test removed 396 transitions
Reduce isomorphic transitions removed 396 transitions.
Iterating post reduction 0 with 396 rules applied. Total rules applied 397 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 400 place count 6 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 401 place count 6 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 402 place count 6 transition count 5
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 405 place count 4 transition count 4
Applied a total of 405 rules in 22 ms. Remains 4 /800 variables (removed 796) and now considering 4/40400 (removed 40396) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2024-05-22 22:02:36] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 22:02:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 22:02:36] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 22:02:36] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-22 22:02:36] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 4 factoid took 395 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Product exploration explored 100000 steps with 0 reset in 5683 ms.
Product exploration explored 100000 steps with 0 reset in 5950 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Support contains 3 out of 800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 1442 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 22:02:50] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2024-05-22 22:02:50] [INFO ] Computed 400 invariants in 5 ms
[2024-05-22 22:03:03] [INFO ] Dead Transitions using invariants and state equation in 12951 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14399 ms. Remains : 800/800 places, 40400/40400 transitions.
Built C files in :
/tmp/ltsmin15710311267662741044
[2024-05-22 22:03:04] [INFO ] Built C files in 259ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15710311267662741044
Running compilation step : cd /tmp/ltsmin15710311267662741044;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15710311267662741044;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15710311267662741044;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 643 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-22 22:03:07] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 22:03:07] [INFO ] Invariant cache hit.
[2024-05-22 22:03:14] [INFO ] Implicit Places using invariants in 6132 ms returned []
Implicit Place search using SMT only with invariants took 6133 ms to find 0 implicit places.
[2024-05-22 22:03:14] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-22 22:03:14] [INFO ] Invariant cache hit.
[2024-05-22 22:03:26] [INFO ] Dead Transitions using invariants and state equation in 12689 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19468 ms. Remains : 800/800 places, 40400/40400 transitions.
Built C files in :
/tmp/ltsmin4906475102562128613
[2024-05-22 22:03:27] [INFO ] Built C files in 275ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4906475102562128613
Running compilation step : cd /tmp/ltsmin4906475102562128613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4906475102562128613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4906475102562128613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 22:03:32] [INFO ] Flatten gal took : 1371 ms
[2024-05-22 22:03:33] [INFO ] Flatten gal took : 1255 ms
[2024-05-22 22:03:33] [INFO ] Time to serialize gal into /tmp/LTL2625621818800776162.gal : 185 ms
[2024-05-22 22:03:33] [INFO ] Time to serialize properties into /tmp/LTL16271431189566586998.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2625621818800776162.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15042857793498439150.hoa' '-atoms' '/tmp/LTL16271431189566586998.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16271431189566586998.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15042857793498439150.hoa
Detected timeout of ITS tools.
[2024-05-22 22:03:51] [INFO ] Flatten gal took : 1381 ms
[2024-05-22 22:03:52] [INFO ] Flatten gal took : 1240 ms
[2024-05-22 22:03:52] [INFO ] Time to serialize gal into /tmp/LTL5201651470499038261.gal : 164 ms
[2024-05-22 22:03:52] [INFO ] Time to serialize properties into /tmp/LTL1458298454522501626.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5201651470499038261.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1458298454522501626.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(F("(flag_1_145==0)")))&&(G("((p3_85==0)||(flag_0_97==1))"))))
Formula 0 simplified : XG!"(flag_1_145==0)" | F!"((p3_85==0)||(flag_0_97==1))"
Detected timeout of ITS tools.
[2024-05-22 22:04:08] [INFO ] Flatten gal took : 1292 ms
[2024-05-22 22:04:08] [INFO ] Applying decomposition
[2024-05-22 22:04:10] [INFO ] Flatten gal took : 1227 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph513024889235090498.txt' '-o' '/tmp/graph513024889235090498.bin' '-w' '/tmp/graph513024889235090498.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph513024889235090498.bin' '-l' '-1' '-v' '-w' '/tmp/graph513024889235090498.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:04:12] [INFO ] Decomposing Gal with order
[2024-05-22 22:04:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:04:15] [INFO ] Removed a total of 118800 redundant transitions.
[2024-05-22 22:04:15] [INFO ] Flatten gal took : 1839 ms
[2024-05-22 22:04:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 755 ms.
[2024-05-22 22:04:16] [INFO ] Time to serialize gal into /tmp/LTL7261177097129393792.gal : 104 ms
[2024-05-22 22:04:16] [INFO ] Time to serialize properties into /tmp/LTL3769552350345160436.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7261177097129393792.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3769552350345160436.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5130554660188017665
[2024-05-22 22:04:31] [INFO ] Built C files in 332ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5130554660188017665
Running compilation step : cd /tmp/ltsmin5130554660188017665;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5130554660188017665;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5130554660188017665;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Dekker-PT-200-LTLCardinality-13 finished in 218668 ms.
[2024-05-22 22:04:36] [INFO ] Flatten gal took : 1329 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14808303597492226984
[2024-05-22 22:04:37] [INFO ] Too many transitions (40400) to apply POR reductions. Disabling POR matrices.
[2024-05-22 22:04:37] [INFO ] Built C files in 395ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14808303597492226984
Running compilation step : cd /tmp/ltsmin14808303597492226984;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-22 22:04:37] [INFO ] Applying decomposition
[2024-05-22 22:04:39] [INFO ] Flatten gal took : 1407 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph768648587522977670.txt' '-o' '/tmp/graph768648587522977670.bin' '-w' '/tmp/graph768648587522977670.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph768648587522977670.bin' '-l' '-1' '-v' '-w' '/tmp/graph768648587522977670.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:04:41] [INFO ] Decomposing Gal with order
[2024-05-22 22:04:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:04:44] [INFO ] Removed a total of 119397 redundant transitions.
[2024-05-22 22:04:44] [INFO ] Flatten gal took : 1689 ms
[2024-05-22 22:04:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 943 ms.
[2024-05-22 22:04:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality9884104462146921319.gal : 107 ms
[2024-05-22 22:04:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality14626900557398782771.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9884104462146921319.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14626900557398782771.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F(G(("(((u150.p3_150==0)||(u136.p3_136==1))||(u7.p3_7==1))")&&(("((u150.p3_150==0)||(u136.p3_136==1))")||(F("((u173.p3_173==0)||(u4...175
Formula 0 simplified : GF(!"(((u150.p3_150==0)||(u136.p3_136==1))||(u7.p3_7==1))" | (!"((u150.p3_150==0)||(u136.p3_136==1))" & G!"((u173.p3_173==0)||(u42.p...167
Reverse transition relation is NOT exact ! Due to transitions u0.t201, u1.t403, u2.t605, u3.t807, u4.t1009, u5.t1211, u6.t1413, u7.t1615, u8.t1817, u9.t201...2604
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
20974 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,226.431,3246212,1,0,9.49407e+06,20330,109290,4.16646e+06,76,20489,24618
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-200-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X(F("(u145.flag_1_145==0)")))&&(G("((u85.p3_85==0)||(u97.flag_0_97==1))"))))
Formula 1 simplified : XG!"(u145.flag_1_145==0)" | F!"((u85.p3_85==0)||(u97.flag_0_97==1))"
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
2678 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,253.208,3246212,1,0,9.49407e+06,20330,134233,4.16646e+06,86,20489,85453
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Dekker-PT-200-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1257704 ms.

BK_STOP 1716415741558

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-200"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Dekker-PT-200, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r153-tall-171631151000077"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;