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.r602-tall-171774424600179.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 itstools
Input is BlocksWorld-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r602-tall-171774424600179
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 83K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 410K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 176K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 991K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 13K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 43K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 186K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 89K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 444K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 91K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 510K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 16K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 39K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 330K Jun 7 06:26 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 BlocksWorld-PT-03-LTLCardinality-00
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-01
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-02
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-03
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-04
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-05
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-06
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-07
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-08
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-09
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-10
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-11
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-12
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-13
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-14
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717748454208

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-07 08:20:55] [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-06-07 08:20:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 08:20:55] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2024-06-07 08:20:55] [INFO ] Transformed 379 places.
[2024-06-07 08:20:55] [INFO ] Transformed 685 transitions.
[2024-06-07 08:20:55] [INFO ] Found NUPN structural information;
[2024-06-07 08:20:55] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17]
[2024-06-07 08:20:55] [INFO ] Parsed PT model containing 379 places and 685 transitions and 3412 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BlocksWorld-PT-03-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 685/685 transitions.
Applied a total of 0 rules in 44 ms. Remains 379 /379 variables (removed 0) and now considering 685/685 (removed 0) transitions.
// Phase 1: matrix 685 rows 379 cols
[2024-06-07 08:20:55] [INFO ] Computed 37 invariants in 30 ms
[2024-06-07 08:20:56] [INFO ] Implicit Places using invariants in 472 ms returned []
[2024-06-07 08:20:56] [INFO ] Invariant cache hit.
[2024-06-07 08:20:56] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-06-07 08:20:56] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
Running 680 sub problems to find dead transitions.
[2024-06-07 08:20:56] [INFO ] Invariant cache hit.
[2024-06-07 08:20:56] [INFO ] State equation strengthened by 27 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD682 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 27/27 constraints. Problems are: Problem set: 26 solved, 654 unsolved
[2024-06-07 08:21:05] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 1/28 constraints. Problems are: Problem set: 26 solved, 654 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 0/28 constraints. Problems are: Problem set: 26 solved, 654 unsolved
Problem TDEAD93 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD678 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/379 variables, 10/38 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/38 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 5 (OVERLAPS) 684/1063 variables, 379/417 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1063 variables, 26/443 constraints. Problems are: Problem set: 36 solved, 644 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 timeout
1.0)
(s217 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1063/1064 variables, and 443 constraints, problems are : Problem set: 36 solved, 644 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 26/27 constraints, PredecessorRefiner: 680/680 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 36 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 1/1 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 1/2 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/2 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 3 (OVERLAPS) 23/379 variables, 36/38 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/38 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 5 (OVERLAPS) 684/1063 variables, 379/417 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1063 variables, 26/443 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1063 variables, 644/1087 constraints. Problems are: Problem set: 36 solved, 644 unsolved
[2024-06-07 08:21:56] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-06-07 08:21:56] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-06-07 08:21:56] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-07 08:21:56] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-06-07 08:21:56] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-06-07 08:21:57] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 1 ms to minimize.
[2024-06-07 08:21:57] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-07 08:21:57] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 08:21:58] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:21:58] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:21:58] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
[2024-06-07 08:21:59] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 3 ms to minimize.
[2024-06-07 08:21:59] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:22:00] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-07 08:22:01] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:22:01] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1063/1064 variables, and 1103 constraints, problems are : Problem set: 36 solved, 644 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 26/27 constraints, PredecessorRefiner: 644/680 constraints, Known Traps: 17/17 constraints]
After SMT, in 64526ms problems are : Problem set: 36 solved, 644 unsolved
Search for dead transitions found 36 dead transitions in 64561ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 379/379 places, 649/685 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 361 transition count 649
Applied a total of 18 rules in 19 ms. Remains 361 /379 variables (removed 18) and now considering 649/649 (removed 0) transitions.
// Phase 1: matrix 649 rows 361 cols
[2024-06-07 08:22:01] [INFO ] Computed 37 invariants in 10 ms
[2024-06-07 08:22:01] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-06-07 08:22:01] [INFO ] Invariant cache hit.
[2024-06-07 08:22:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:22:02] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 361/379 places, 649/685 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66314 ms. Remains : 361/379 places, 649/685 transitions.
Support contains 55 out of 361 places after structural reductions.
[2024-06-07 08:22:02] [INFO ] Flatten gal took : 82 ms
[2024-06-07 08:22:02] [INFO ] Flatten gal took : 48 ms
[2024-06-07 08:22:02] [INFO ] Input system was already deterministic with 649 transitions.
RANDOM walk for 40000 steps (8 resets) in 2525 ms. (15 steps per ms) remains 10/25 properties
BEST_FIRST walk for 40001 steps (8 resets) in 426 ms. (93 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 361 ms. (110 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 250 ms. (159 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 342 ms. (116 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 323 ms. (123 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 263 ms. (151 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 260 ms. (153 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 179 ms. (222 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 189 ms. (210 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 10/10 properties
[2024-06-07 08:22:04] [INFO ] Invariant cache hit.
[2024-06-07 08:22:04] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp14 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 2 (OVERLAPS) 306/361 variables, 36/37 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1010 variables, 0/399 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1010 variables, 0/399 constraints. Problems are: Problem set: 5 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 5 solved, 5 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-06-07 08:22:04] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 1/2 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 5 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 3 (OVERLAPS) 306/361 variables, 36/38 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-06-07 08:22:05] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 2 ms to minimize.
[2024-06-07 08:22:05] [INFO ] Deduced a trap composed of 96 places in 156 ms of which 3 ms to minimize.
[2024-06-07 08:22:05] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 2 ms to minimize.
[2024-06-07 08:22:05] [INFO ] Deduced a trap composed of 99 places in 152 ms of which 2 ms to minimize.
[2024-06-07 08:22:05] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 2 ms to minimize.
[2024-06-07 08:22:06] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 3 ms to minimize.
[2024-06-07 08:22:06] [INFO ] Deduced a trap composed of 64 places in 158 ms of which 2 ms to minimize.
[2024-06-07 08:22:06] [INFO ] Deduced a trap composed of 99 places in 153 ms of which 3 ms to minimize.
[2024-06-07 08:22:06] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 2 ms to minimize.
[2024-06-07 08:22:06] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 3 ms to minimize.
[2024-06-07 08:22:06] [INFO ] Deduced a trap composed of 84 places in 152 ms of which 3 ms to minimize.
[2024-06-07 08:22:06] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 2 ms to minimize.
[2024-06-07 08:22:07] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 2 ms to minimize.
[2024-06-07 08:22:07] [INFO ] Deduced a trap composed of 91 places in 152 ms of which 2 ms to minimize.
[2024-06-07 08:22:07] [INFO ] Deduced a trap composed of 51 places in 151 ms of which 2 ms to minimize.
[2024-06-07 08:22:07] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 3 ms to minimize.
[2024-06-07 08:22:07] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 6 ms to minimize.
[2024-06-07 08:22:07] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 3 ms to minimize.
[2024-06-07 08:22:08] [INFO ] Deduced a trap composed of 51 places in 159 ms of which 2 ms to minimize.
[2024-06-07 08:22:08] [INFO ] Deduced a trap composed of 84 places in 162 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 20/58 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-06-07 08:22:08] [INFO ] Deduced a trap composed of 84 places in 153 ms of which 2 ms to minimize.
[2024-06-07 08:22:08] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 3 ms to minimize.
[2024-06-07 08:22:08] [INFO ] Deduced a trap composed of 75 places in 163 ms of which 2 ms to minimize.
[2024-06-07 08:22:08] [INFO ] Deduced a trap composed of 96 places in 154 ms of which 2 ms to minimize.
[2024-06-07 08:22:09] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 2 ms to minimize.
[2024-06-07 08:22:09] [INFO ] Deduced a trap composed of 84 places in 157 ms of which 2 ms to minimize.
[2024-06-07 08:22:09] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 2 ms to minimize.
[2024-06-07 08:22:09] [INFO ] Deduced a trap composed of 75 places in 157 ms of which 3 ms to minimize.
[2024-06-07 08:22:09] [INFO ] Deduced a trap composed of 51 places in 150 ms of which 3 ms to minimize.
[2024-06-07 08:22:09] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 3 ms to minimize.
SMT process timed out in 5639ms, After SMT, problems are : Problem set: 6 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 649/649 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 361 transition count 648
Applied a total of 1 rules in 333 ms. Remains 361 /361 variables (removed 0) and now considering 648/649 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 334 ms. Remains : 361/361 places, 648/649 transitions.
RANDOM walk for 40000 steps (8 resets) in 656 ms. (60 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 230 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 239 ms. (166 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 191919 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 4
Probabilistic random walk after 191919 steps, saw 151808 distinct states, run finished after 3006 ms. (steps per millisecond=63 ) properties seen :0
// Phase 1: matrix 648 rows 361 cols
[2024-06-07 08:22:13] [INFO ] Computed 37 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 307/361 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1009/1009 variables, and 398 constraints, problems are : Problem set: 0 solved, 4 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 307/361 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-07 08:22:14] [INFO ] Deduced a trap composed of 51 places in 158 ms of which 3 ms to minimize.
[2024-06-07 08:22:14] [INFO ] Deduced a trap composed of 51 places in 151 ms of which 3 ms to minimize.
[2024-06-07 08:22:14] [INFO ] Deduced a trap composed of 51 places in 148 ms of which 3 ms to minimize.
[2024-06-07 08:22:14] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 2 ms to minimize.
[2024-06-07 08:22:15] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 2 ms to minimize.
[2024-06-07 08:22:15] [INFO ] Deduced a trap composed of 75 places in 156 ms of which 3 ms to minimize.
[2024-06-07 08:22:15] [INFO ] Deduced a trap composed of 51 places in 159 ms of which 3 ms to minimize.
[2024-06-07 08:22:15] [INFO ] Deduced a trap composed of 75 places in 156 ms of which 2 ms to minimize.
[2024-06-07 08:22:15] [INFO ] Deduced a trap composed of 100 places in 157 ms of which 3 ms to minimize.
[2024-06-07 08:22:15] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 2 ms to minimize.
[2024-06-07 08:22:16] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 2 ms to minimize.
[2024-06-07 08:22:16] [INFO ] Deduced a trap composed of 75 places in 154 ms of which 2 ms to minimize.
[2024-06-07 08:22:16] [INFO ] Deduced a trap composed of 51 places in 151 ms of which 3 ms to minimize.
[2024-06-07 08:22:16] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 2 ms to minimize.
[2024-06-07 08:22:16] [INFO ] Deduced a trap composed of 51 places in 144 ms of which 2 ms to minimize.
[2024-06-07 08:22:16] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 3 ms to minimize.
[2024-06-07 08:22:17] [INFO ] Deduced a trap composed of 99 places in 155 ms of which 3 ms to minimize.
[2024-06-07 08:22:17] [INFO ] Deduced a trap composed of 75 places in 154 ms of which 2 ms to minimize.
[2024-06-07 08:22:17] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 2 ms to minimize.
[2024-06-07 08:22:17] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-07 08:22:17] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 2 ms to minimize.
[2024-06-07 08:22:17] [INFO ] Deduced a trap composed of 75 places in 150 ms of which 2 ms to minimize.
[2024-06-07 08:22:18] [INFO ] Deduced a trap composed of 64 places in 146 ms of which 2 ms to minimize.
[2024-06-07 08:22:18] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 3 ms to minimize.
[2024-06-07 08:22:18] [INFO ] Deduced a trap composed of 64 places in 140 ms of which 3 ms to minimize.
[2024-06-07 08:22:18] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 2 ms to minimize.
[2024-06-07 08:22:18] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 2 ms to minimize.
[2024-06-07 08:22:18] [INFO ] Deduced a trap composed of 64 places in 156 ms of which 2 ms to minimize.
[2024-06-07 08:22:18] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 2 ms to minimize.
[2024-06-07 08:22:19] [INFO ] Deduced a trap composed of 51 places in 145 ms of which 3 ms to minimize.
[2024-06-07 08:22:19] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 2 ms to minimize.
[2024-06-07 08:22:19] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 3 ms to minimize.
[2024-06-07 08:22:19] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 3 ms to minimize.
[2024-06-07 08:22:19] [INFO ] Deduced a trap composed of 75 places in 155 ms of which 3 ms to minimize.
[2024-06-07 08:22:19] [INFO ] Deduced a trap composed of 51 places in 150 ms of which 2 ms to minimize.
[2024-06-07 08:22:20] [INFO ] Deduced a trap composed of 51 places in 148 ms of which 2 ms to minimize.
[2024-06-07 08:22:20] [INFO ] Deduced a trap composed of 75 places in 161 ms of which 2 ms to minimize.
[2024-06-07 08:22:20] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 2 ms to minimize.
[2024-06-07 08:22:20] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 2 ms to minimize.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Int declared 361/1009 variables, and 76 constraints, problems are : Problem set: 4 solved, 0 unsolved in 6600 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/361 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 39/39 constraints]
After SMT, in 6976ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA BlocksWorld-PT-03-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 10 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 3 formulas.
FORMULA BlocksWorld-PT-03-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 18 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 9 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
// Phase 1: matrix 649 rows 361 cols
[2024-06-07 08:22:21] [INFO ] Computed 37 invariants in 9 ms
[2024-06-07 08:22:21] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-06-07 08:22:21] [INFO ] Invariant cache hit.
[2024-06-07 08:22:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:22:21] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 08:22:21] [INFO ] Invariant cache hit.
[2024-06-07 08:22:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:23:18] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2024-06-07 08:23:18] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
[2024-06-07 08:23:19] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 1 ms to minimize.
[2024-06-07 08:23:19] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2024-06-07 08:23:20] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
[2024-06-07 08:23:20] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 1 ms to minimize.
[2024-06-07 08:23:21] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:23:21] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-06-07 08:23:21] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 1 ms to minimize.
[2024-06-07 08:23:22] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-07 08:23:22] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-06-07 08:23:22] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:23:23] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:23:24] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 08:23:25] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 08:23:25] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 64076ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 64083ms
Finished structural reductions in LTL mode , in 1 iterations and 64674 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 304 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 215 steps with 0 reset in 16 ms.
FORMULA BlocksWorld-PT-03-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-03-LTLCardinality-00 finished in 65059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 54 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 36 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:23:26] [INFO ] Invariant cache hit.
[2024-06-07 08:23:26] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-06-07 08:23:26] [INFO ] Invariant cache hit.
[2024-06-07 08:23:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:23:26] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2024-06-07 08:23:26] [INFO ] Redundant transitions in 36 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 08:23:26] [INFO ] Invariant cache hit.
[2024-06-07 08:23:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:24:22] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 1 ms to minimize.
[2024-06-07 08:24:22] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 2 ms to minimize.
[2024-06-07 08:24:23] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-06-07 08:24:23] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-06-07 08:24:24] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 0 ms to minimize.
[2024-06-07 08:24:25] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 1 ms to minimize.
[2024-06-07 08:24:25] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:24:25] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 0 ms to minimize.
[2024-06-07 08:24:26] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 1 ms to minimize.
[2024-06-07 08:24:26] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-06-07 08:24:26] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-06-07 08:24:26] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 08:24:27] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:24:28] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 08:24:29] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2024-06-07 08:24:29] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2024-06-07 08:24:30] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 1 ms to minimize.
SMT process timed out in 63842ms, After SMT, problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63849ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64481 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 1488 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA BlocksWorld-PT-03-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-03-LTLCardinality-01 finished in 66037 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 36 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 6 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:24:32] [INFO ] Invariant cache hit.
[2024-06-07 08:24:32] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-06-07 08:24:32] [INFO ] Invariant cache hit.
[2024-06-07 08:24:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:24:32] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 08:24:32] [INFO ] Invariant cache hit.
[2024-06-07 08:24:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:25:28] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
[2024-06-07 08:25:29] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 2 ms to minimize.
[2024-06-07 08:25:29] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-06-07 08:25:29] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-06-07 08:25:31] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-07 08:25:31] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 2 ms to minimize.
[2024-06-07 08:25:31] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2024-06-07 08:25:31] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2024-06-07 08:25:32] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-06-07 08:25:32] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-06-07 08:25:32] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-06-07 08:25:32] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:25:34] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 08:25:34] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-07 08:25:35] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:25:35] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 2 ms to minimize.
[2024-06-07 08:25:36] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-06-07 08:25:36] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1060 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 18/18 constraints]
After SMT, in 63881ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63888ms
Finished structural reductions in LTL mode , in 1 iterations and 64608 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BlocksWorld-PT-03-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-03-LTLCardinality-03 finished in 64715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 36 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 28 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:25:36] [INFO ] Invariant cache hit.
[2024-06-07 08:25:37] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-06-07 08:25:37] [INFO ] Invariant cache hit.
[2024-06-07 08:25:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:25:37] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
[2024-06-07 08:25:37] [INFO ] Redundant transitions in 6 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 08:25:37] [INFO ] Invariant cache hit.
[2024-06-07 08:25:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:26:32] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 1 ms to minimize.
[2024-06-07 08:26:32] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 2 ms to minimize.
[2024-06-07 08:26:33] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-06-07 08:26:33] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-06-07 08:26:35] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 3 ms to minimize.
[2024-06-07 08:26:35] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 1 ms to minimize.
[2024-06-07 08:26:35] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 0 ms to minimize.
[2024-06-07 08:26:35] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:26:36] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 1 ms to minimize.
[2024-06-07 08:26:36] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-07 08:26:36] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-07 08:26:36] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 08:26:38] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:26:38] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 0 ms to minimize.
[2024-06-07 08:26:39] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2024-06-07 08:26:39] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-06-07 08:26:40] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 1 ms to minimize.
[2024-06-07 08:26:40] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2024-06-07 08:26:40] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1061 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 19/19 constraints]
After SMT, in 63115ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63121ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63959 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-05
Product exploration explored 100000 steps with 209 reset in 973 ms.
Stack based approach found an accepted trace after 951 steps with 1 reset with depth 373 and stack size 260 in 11 ms.
FORMULA BlocksWorld-PT-03-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-03-LTLCardinality-05 finished in 65052 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 18 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 21 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:26:41] [INFO ] Invariant cache hit.
[2024-06-07 08:26:42] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-06-07 08:26:42] [INFO ] Invariant cache hit.
[2024-06-07 08:26:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:26:42] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
[2024-06-07 08:26:42] [INFO ] Redundant transitions in 4 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 08:26:42] [INFO ] Invariant cache hit.
[2024-06-07 08:26:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:27:37] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 2 ms to minimize.
[2024-06-07 08:27:38] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 2 ms to minimize.
[2024-06-07 08:27:38] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 1 ms to minimize.
[2024-06-07 08:27:38] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 2 ms to minimize.
[2024-06-07 08:27:40] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 0 ms to minimize.
[2024-06-07 08:27:40] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-06-07 08:27:40] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:27:40] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
[2024-06-07 08:27:41] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-06-07 08:27:41] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:27:41] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:27:41] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 08:27:43] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-06-07 08:27:44] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:27:44] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:27:44] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-07 08:27:45] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 1 ms to minimize.
[2024-06-07 08:27:45] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-06-07 08:27:46] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 2 ms to minimize.
SMT process timed out in 63555ms, After SMT, problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63562ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64237 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-06
Product exploration explored 100000 steps with 25056 reset in 662 ms.
Product exploration explored 100000 steps with 25005 reset in 706 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 : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
[2024-06-07 08:27:48] [INFO ] Invariant cache hit.
[2024-06-07 08:27:48] [INFO ] [Real]Absence check using 37 positive place invariants in 21 ms returned sat
[2024-06-07 08:27:49] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2024-06-07 08:27:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 08:27:49] [INFO ] [Nat]Absence check using 37 positive place invariants in 27 ms returned sat
[2024-06-07 08:27:50] [INFO ] [Nat]Absence check using state equation in 618 ms returned sat
[2024-06-07 08:27:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:27:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-06-07 08:27:50] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 1 ms to minimize.
[2024-06-07 08:27:50] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-06-07 08:27:50] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 1 ms to minimize.
[2024-06-07 08:27:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 341 ms
[2024-06-07 08:27:50] [INFO ] Computed and/alt/rep : 85/85/85 causal constraints (skipped 559 transitions) in 61 ms.
[2024-06-07 08:27:50] [INFO ] Added : 0 causal constraints over 0 iterations in 122 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 18 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 24 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:27:50] [INFO ] Invariant cache hit.
[2024-06-07 08:27:50] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-07 08:27:50] [INFO ] Invariant cache hit.
[2024-06-07 08:27:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:27:51] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2024-06-07 08:27:51] [INFO ] Redundant transitions in 4 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 08:27:51] [INFO ] Invariant cache hit.
[2024-06-07 08:27:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:28:46] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 08:28:47] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 1 ms to minimize.
[2024-06-07 08:28:47] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-06-07 08:28:47] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-06-07 08:28:49] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:28:49] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 1 ms to minimize.
[2024-06-07 08:28:49] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-07 08:28:49] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-06-07 08:28:50] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-06-07 08:28:50] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-07 08:28:50] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-07 08:28:50] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 08:28:52] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 2 ms to minimize.
[2024-06-07 08:28:52] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:28:53] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 08:28:53] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63233ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63240ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63858 ms. Remains : 361/361 places, 649/649 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 : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
[2024-06-07 08:28:54] [INFO ] Invariant cache hit.
[2024-06-07 08:28:55] [INFO ] [Real]Absence check using 37 positive place invariants in 19 ms returned sat
[2024-06-07 08:28:55] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2024-06-07 08:28:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 08:28:56] [INFO ] [Nat]Absence check using 37 positive place invariants in 37 ms returned sat
[2024-06-07 08:28:56] [INFO ] [Nat]Absence check using state equation in 617 ms returned sat
[2024-06-07 08:28:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:28:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-06-07 08:28:56] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 1 ms to minimize.
[2024-06-07 08:28:57] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-06-07 08:28:57] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 1 ms to minimize.
[2024-06-07 08:28:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 340 ms
[2024-06-07 08:28:57] [INFO ] Computed and/alt/rep : 85/85/85 causal constraints (skipped 559 transitions) in 61 ms.
[2024-06-07 08:28:57] [INFO ] Added : 0 causal constraints over 0 iterations in 127 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 24819 reset in 665 ms.
Product exploration explored 100000 steps with 25080 reset in 668 ms.
Built C files in :
/tmp/ltsmin15106542185982529090
[2024-06-07 08:28:58] [INFO ] Computing symmetric may disable matrix : 649 transitions.
[2024-06-07 08:28:58] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-07 08:28:58] [INFO ] Computing symmetric may enable matrix : 649 transitions.
[2024-06-07 08:28:58] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-07 08:28:58] [INFO ] Computing Do-Not-Accords matrix : 649 transitions.
[2024-06-07 08:28:58] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-07 08:28:58] [INFO ] Built C files in 178ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15106542185982529090
Running compilation step : cd /tmp/ltsmin15106542185982529090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2417 ms.
Running link step : cd /tmp/ltsmin15106542185982529090;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin15106542185982529090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9908257378090428091.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 18 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 26 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:29:13] [INFO ] Invariant cache hit.
[2024-06-07 08:29:14] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-06-07 08:29:14] [INFO ] Invariant cache hit.
[2024-06-07 08:29:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:29:14] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2024-06-07 08:29:14] [INFO ] Redundant transitions in 5 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 08:29:14] [INFO ] Invariant cache hit.
[2024-06-07 08:29:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:30:10] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 1 ms to minimize.
[2024-06-07 08:30:10] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 1 ms to minimize.
[2024-06-07 08:30:11] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-06-07 08:30:11] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 1 ms to minimize.
[2024-06-07 08:30:12] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-07 08:30:13] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 1 ms to minimize.
[2024-06-07 08:30:13] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 08:30:13] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:30:14] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-06-07 08:30:14] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-07 08:30:14] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-07 08:30:14] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 08:30:15] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:30:16] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:30:17] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2024-06-07 08:30:17] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63547ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63553ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64211 ms. Remains : 361/361 places, 649/649 transitions.
Built C files in :
/tmp/ltsmin17233051827360199801
[2024-06-07 08:30:18] [INFO ] Computing symmetric may disable matrix : 649 transitions.
[2024-06-07 08:30:18] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-07 08:30:18] [INFO ] Computing symmetric may enable matrix : 649 transitions.
[2024-06-07 08:30:18] [INFO ] Computation of Complete enable matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-07 08:30:18] [INFO ] Computing Do-Not-Accords matrix : 649 transitions.
[2024-06-07 08:30:18] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-07 08:30:18] [INFO ] Built C files in 167ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17233051827360199801
Running compilation step : cd /tmp/ltsmin17233051827360199801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2312 ms.
Running link step : cd /tmp/ltsmin17233051827360199801;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin17233051827360199801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9398200079238607848.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-07 08:30:33] [INFO ] Flatten gal took : 38 ms
[2024-06-07 08:30:33] [INFO ] Flatten gal took : 33 ms
[2024-06-07 08:30:33] [INFO ] Time to serialize gal into /tmp/LTL6811917669566101495.gal : 8 ms
[2024-06-07 08:30:33] [INFO ] Time to serialize properties into /tmp/LTL7281942047753897429.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6811917669566101495.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3989722550868849490.hoa' '-atoms' '/tmp/LTL7281942047753897429.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7281942047753897429.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3989722550868849490.hoa
Detected timeout of ITS tools.
[2024-06-07 08:30:48] [INFO ] Flatten gal took : 31 ms
[2024-06-07 08:30:48] [INFO ] Flatten gal took : 28 ms
[2024-06-07 08:30:48] [INFO ] Time to serialize gal into /tmp/LTL5780203169881125615.gal : 8 ms
[2024-06-07 08:30:48] [INFO ] Time to serialize properties into /tmp/LTL11948932616934877912.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5780203169881125615.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11948932616934877912.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((pred_holding_0+pred_holding_1)+(pred_holding_2+pred_holding_3))+((pred_holding_4+pred_holding_5)+(pred_holding_6+pred_ho...350
Formula 0 simplified : FG!"((((((pred_holding_0+pred_holding_1)+(pred_holding_2+pred_holding_3))+((pred_holding_4+pred_holding_5)+(pred_holding_6+pred_hold...344
Detected timeout of ITS tools.
[2024-06-07 08:31:03] [INFO ] Flatten gal took : 26 ms
[2024-06-07 08:31:03] [INFO ] Applying decomposition
[2024-06-07 08:31:03] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17008151108558531426.txt' '-o' '/tmp/graph17008151108558531426.bin' '-w' '/tmp/graph17008151108558531426.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17008151108558531426.bin' '-l' '-1' '-v' '-w' '/tmp/graph17008151108558531426.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:31:03] [INFO ] Decomposing Gal with order
[2024-06-07 08:31:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:31:04] [INFO ] Removed a total of 598 redundant transitions.
[2024-06-07 08:31:04] [INFO ] Flatten gal took : 549 ms
[2024-06-07 08:31:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 612 labels/synchronizations in 35 ms.
[2024-06-07 08:31:04] [INFO ] Time to serialize gal into /tmp/LTL9982184192045324062.gal : 7 ms
[2024-06-07 08:31:04] [INFO ] Time to serialize properties into /tmp/LTL6424160741364415887.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9982184192045324062.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6424160741364415887.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((gu4.pred_holding_0+gu4.pred_holding_1)+(gu4.pred_holding_2+gu4.pred_holding_3))+((gu4.pred_holding_4+gu4.pred_holding_5)...422
Formula 0 simplified : FG!"((((((gu4.pred_holding_0+gu4.pred_holding_1)+(gu4.pred_holding_2+gu4.pred_holding_3))+((gu4.pred_holding_4+gu4.pred_holding_5)+(...416
Detected timeout of ITS tools.
Treatment of property BlocksWorld-PT-03-LTLCardinality-06 finished in 277520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((!p1||X(X(p1))))))'
Support contains 19 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 10 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:31:19] [INFO ] Invariant cache hit.
[2024-06-07 08:31:19] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-06-07 08:31:19] [INFO ] Invariant cache hit.
[2024-06-07 08:31:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:31:20] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 08:31:20] [INFO ] Invariant cache hit.
[2024-06-07 08:31:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:32:16] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 1 ms to minimize.
[2024-06-07 08:32:16] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 4 ms to minimize.
[2024-06-07 08:32:17] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 1 ms to minimize.
[2024-06-07 08:32:17] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-06-07 08:32:18] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:32:18] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 1 ms to minimize.
[2024-06-07 08:32:18] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:32:19] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-07 08:32:19] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-06-07 08:32:19] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-07 08:32:19] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-07 08:32:20] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 08:32:21] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-07 08:32:22] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 08:32:22] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-07 08:32:23] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63988ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63994ms
Finished structural reductions in LTL mode , in 1 iterations and 64576 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 393 ms :[false, (NOT p1), false, false, (NOT p1), true, false, false, (NOT p1), false]
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-07
Product exploration explored 100000 steps with 20053 reset in 824 ms.
Product exploration explored 100000 steps with 19988 reset in 841 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 (NOT p0) p1), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 103 ms. Reduced automaton from 10 states, 19 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[false, (NOT p1), false, (NOT p1), true]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 11 factoid took 145 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[false, (NOT p1), false, (NOT p1), true]
Stuttering acceptance computed with spot in 152 ms :[false, (NOT p1), false, (NOT p1), true]
Support contains 1 out of 361 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 6 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:32:26] [INFO ] Invariant cache hit.
[2024-06-07 08:32:27] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-06-07 08:32:27] [INFO ] Invariant cache hit.
[2024-06-07 08:32:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:32:27] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 08:32:27] [INFO ] Invariant cache hit.
[2024-06-07 08:32:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:33:23] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 2 ms to minimize.
[2024-06-07 08:33:23] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 2 ms to minimize.
[2024-06-07 08:33:24] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-06-07 08:33:24] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-06-07 08:33:25] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:33:25] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 2 ms to minimize.
[2024-06-07 08:33:26] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:33:26] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-06-07 08:33:26] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 1 ms to minimize.
[2024-06-07 08:33:27] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-07 08:33:27] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-07 08:33:27] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 08:33:28] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:33:29] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:33:29] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:33:30] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 2 ms to minimize.
[2024-06-07 08:33:31] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 3 ms to minimize.
[2024-06-07 08:33:31] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-06-07 08:33:31] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1061 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 19/19 constraints]
After SMT, in 64061ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 64067ms
Finished structural reductions in LTL mode , in 1 iterations and 64650 ms. Remains : 361/361 places, 649/649 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 : [p1, (X (NOT p1)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[false, (NOT p1), false, (NOT p1), true]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X (NOT p1)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[false, (NOT p1), false, (NOT p1), true]
Stuttering acceptance computed with spot in 241 ms :[false, (NOT p1), false, (NOT p1), true]
Stuttering acceptance computed with spot in 179 ms :[false, (NOT p1), false, (NOT p1), true]
Product exploration explored 100000 steps with 14317 reset in 880 ms.
Product exploration explored 100000 steps with 14292 reset in 896 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 183 ms :[false, (NOT p1), false, (NOT p1), true]
Support contains 1 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 33 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:33:34] [INFO ] Redundant transitions in 4 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 08:33:34] [INFO ] Invariant cache hit.
[2024-06-07 08:33:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:34:31] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2024-06-07 08:34:32] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 3 ms to minimize.
[2024-06-07 08:34:32] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-06-07 08:34:32] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-06-07 08:34:34] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-06-07 08:34:34] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 2 ms to minimize.
[2024-06-07 08:34:34] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 08:34:34] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-06-07 08:34:35] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-06-07 08:34:35] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-07 08:34:35] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-07 08:34:35] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-07 08:34:37] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:34:38] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1056 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 14/14 constraints]
After SMT, in 63572ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63579ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63627 ms. Remains : 361/361 places, 649/649 transitions.
Built C files in :
/tmp/ltsmin4827276583145922544
[2024-06-07 08:34:38] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4827276583145922544
Running compilation step : cd /tmp/ltsmin4827276583145922544;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1328 ms.
Running link step : cd /tmp/ltsmin4827276583145922544;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4827276583145922544;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7020400483955902417.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 22 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:34:53] [INFO ] Invariant cache hit.
[2024-06-07 08:34:53] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-06-07 08:34:53] [INFO ] Invariant cache hit.
[2024-06-07 08:34:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:34:54] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 08:34:54] [INFO ] Invariant cache hit.
[2024-06-07 08:34:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:35:49] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:35:49] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
[2024-06-07 08:35:50] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 1 ms to minimize.
[2024-06-07 08:35:50] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-06-07 08:35:51] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:35:52] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 1 ms to minimize.
[2024-06-07 08:35:52] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:35:52] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-06-07 08:35:53] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-06-07 08:35:53] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-07 08:35:53] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-07 08:35:53] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 08:35:54] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-07 08:35:55] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-07 08:35:56] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 0 ms to minimize.
[2024-06-07 08:35:56] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-07 08:35:57] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 1 ms to minimize.
[2024-06-07 08:35:57] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
SMT process timed out in 63334ms, After SMT, problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63340ms
Finished structural reductions in LTL mode , in 1 iterations and 63985 ms. Remains : 361/361 places, 649/649 transitions.
Built C files in :
/tmp/ltsmin5853582709030227344
[2024-06-07 08:35:57] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5853582709030227344
Running compilation step : cd /tmp/ltsmin5853582709030227344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1307 ms.
Running link step : cd /tmp/ltsmin5853582709030227344;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5853582709030227344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11795733141326515031.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-07 08:36:12] [INFO ] Flatten gal took : 33 ms
[2024-06-07 08:36:12] [INFO ] Flatten gal took : 31 ms
[2024-06-07 08:36:12] [INFO ] Time to serialize gal into /tmp/LTL4724111121587550738.gal : 5 ms
[2024-06-07 08:36:12] [INFO ] Time to serialize properties into /tmp/LTL14241244232503229838.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4724111121587550738.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9780153096872298451.hoa' '-atoms' '/tmp/LTL14241244232503229838.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14241244232503229838.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9780153096872298451.hoa
Detected timeout of ITS tools.
[2024-06-07 08:36:27] [INFO ] Flatten gal took : 29 ms
[2024-06-07 08:36:27] [INFO ] Flatten gal took : 26 ms
[2024-06-07 08:36:27] [INFO ] Time to serialize gal into /tmp/LTL3215052706926584427.gal : 9 ms
[2024-06-07 08:36:27] [INFO ] Time to serialize properties into /tmp/LTL15047593597833276524.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3215052706926584427.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15047593597833276524.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((("(pred_arm_empty_0<=(((((pred_holding_0+pred_holding_1)+(pred_holding_2+pred_holding_3))+((pred_holding_4+pred_holding_5)+(pred_ho...424
Formula 0 simplified : !"(pred_arm_empty_0<=(((((pred_holding_0+pred_holding_1)+(pred_holding_2+pred_holding_3))+((pred_holding_4+pred_holding_5)+(pred_hol...415
Detected timeout of ITS tools.
[2024-06-07 08:36:42] [INFO ] Flatten gal took : 28 ms
[2024-06-07 08:36:42] [INFO ] Applying decomposition
[2024-06-07 08:36:42] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4452861928800870045.txt' '-o' '/tmp/graph4452861928800870045.bin' '-w' '/tmp/graph4452861928800870045.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4452861928800870045.bin' '-l' '-1' '-v' '-w' '/tmp/graph4452861928800870045.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:36:42] [INFO ] Decomposing Gal with order
[2024-06-07 08:36:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:36:43] [INFO ] Removed a total of 598 redundant transitions.
[2024-06-07 08:36:43] [INFO ] Flatten gal took : 317 ms
[2024-06-07 08:36:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 1220 labels/synchronizations in 41 ms.
[2024-06-07 08:36:43] [INFO ] Time to serialize gal into /tmp/LTL12227095480773990681.gal : 5 ms
[2024-06-07 08:36:43] [INFO ] Time to serialize properties into /tmp/LTL5209692965523289572.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12227095480773990681.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5209692965523289572.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((("(gu4.pred_arm_empty_0<=(((((gu4.pred_holding_0+gu4.pred_holding_1)+(gu4.pred_holding_2+gu4.pred_holding_3))+((gu4.pred_holding_4+...508
Formula 0 simplified : !"(gu4.pred_arm_empty_0<=(((((gu4.pred_holding_0+gu4.pred_holding_1)+(gu4.pred_holding_2+gu4.pred_holding_3))+((gu4.pred_holding_4+g...499
Detected timeout of ITS tools.
Treatment of property BlocksWorld-PT-03-LTLCardinality-07 finished in 339150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))&&F(p1))))'
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 12 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:36:58] [INFO ] Invariant cache hit.
[2024-06-07 08:36:58] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-06-07 08:36:58] [INFO ] Invariant cache hit.
[2024-06-07 08:36:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:36:59] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 08:36:59] [INFO ] Invariant cache hit.
[2024-06-07 08:36:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:37:54] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 08:37:55] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 2 ms to minimize.
[2024-06-07 08:37:55] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 1 ms to minimize.
[2024-06-07 08:37:55] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 1 ms to minimize.
[2024-06-07 08:37:57] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:37:57] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 1 ms to minimize.
[2024-06-07 08:37:57] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:37:57] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:37:58] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 1 ms to minimize.
[2024-06-07 08:37:58] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-07 08:37:58] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-07 08:37:58] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:38:00] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:38:00] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 08:38:01] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 08:38:01] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-07 08:38:02] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 2 ms to minimize.
SMT process timed out in 63516ms, After SMT, problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63523ms
Finished structural reductions in LTL mode , in 1 iterations and 64073 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-08
Product exploration explored 100000 steps with 19842 reset in 802 ms.
Stack based approach found an accepted trace after 5067 steps with 1008 reset with depth 14 and stack size 14 in 43 ms.
FORMULA BlocksWorld-PT-03-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-03-LTLCardinality-08 finished in 65167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(F(p0))||(p1&&X(p1))))&&F(G(p2))))'
Support contains 6 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 6 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:38:03] [INFO ] Invariant cache hit.
[2024-06-07 08:38:03] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-06-07 08:38:03] [INFO ] Invariant cache hit.
[2024-06-07 08:38:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:38:04] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 08:38:04] [INFO ] Invariant cache hit.
[2024-06-07 08:38:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:39:00] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-07 08:39:01] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
[2024-06-07 08:39:01] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-06-07 08:39:01] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-06-07 08:39:03] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:39:03] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 1 ms to minimize.
[2024-06-07 08:39:03] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 08:39:03] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 0 ms to minimize.
[2024-06-07 08:39:04] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 1 ms to minimize.
[2024-06-07 08:39:04] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-07 08:39:04] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-07 08:39:04] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 08:39:06] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:39:06] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-06-07 08:39:07] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:39:07] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 64102ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 64109ms
Finished structural reductions in LTL mode , in 1 iterations and 64698 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 846 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA BlocksWorld-PT-03-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-03-LTLCardinality-09 finished in 65731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((!p1||X(X(p1))))))'
Found a Lengthening insensitive property : BlocksWorld-PT-03-LTLCardinality-07
Stuttering acceptance computed with spot in 384 ms :[false, (NOT p1), false, false, (NOT p1), true, false, false, (NOT p1), false]
Support contains 19 out of 361 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 13 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:39:10] [INFO ] Invariant cache hit.
[2024-06-07 08:39:10] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-06-07 08:39:10] [INFO ] Invariant cache hit.
[2024-06-07 08:39:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:39:10] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 08:39:10] [INFO ] Invariant cache hit.
[2024-06-07 08:39:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:40:06] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-07 08:40:06] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-06-07 08:40:07] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 1 ms to minimize.
[2024-06-07 08:40:07] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-06-07 08:40:08] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-06-07 08:40:09] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 1 ms to minimize.
[2024-06-07 08:40:09] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-07 08:40:09] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:40:09] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 1 ms to minimize.
[2024-06-07 08:40:10] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 2 ms to minimize.
[2024-06-07 08:40:10] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:40:10] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 08:40:11] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:40:12] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 08:40:13] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
[2024-06-07 08:40:13] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:40:14] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2024-06-07 08:40:14] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:40:14] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
SMT process timed out in 63946ms, After SMT, problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63952ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 64530 ms. Remains : 361/361 places, 649/649 transitions.
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-07
Product exploration explored 100000 steps with 20059 reset in 820 ms.
Product exploration explored 100000 steps with 19957 reset in 841 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 (NOT p0) p1), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 200 ms. Reduced automaton from 10 states, 19 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[false, (NOT p1), false, (NOT p1), true]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 11 factoid took 152 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[false, (NOT p1), false, (NOT p1), true]
Stuttering acceptance computed with spot in 163 ms :[false, (NOT p1), false, (NOT p1), true]
Support contains 1 out of 361 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 7 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:40:17] [INFO ] Invariant cache hit.
[2024-06-07 08:40:17] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-06-07 08:40:17] [INFO ] Invariant cache hit.
[2024-06-07 08:40:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:40:17] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 08:40:17] [INFO ] Invariant cache hit.
[2024-06-07 08:40:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:41:13] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:41:14] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
[2024-06-07 08:41:14] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-06-07 08:41:14] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 1 ms to minimize.
[2024-06-07 08:41:16] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 08:41:16] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 1 ms to minimize.
[2024-06-07 08:41:16] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:41:16] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:41:17] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 1 ms to minimize.
[2024-06-07 08:41:17] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-07 08:41:17] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
[2024-06-07 08:41:17] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 08:41:19] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:41:19] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:41:20] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-07 08:41:20] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63459ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63465ms
Finished structural reductions in LTL mode , in 1 iterations and 64037 ms. Remains : 361/361 places, 649/649 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 : [p1, (X (NOT p1)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[false, (NOT p1), false, (NOT p1), true]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X (NOT p1)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[false, (NOT p1), false, (NOT p1), true]
Stuttering acceptance computed with spot in 182 ms :[false, (NOT p1), false, (NOT p1), true]
Stuttering acceptance computed with spot in 156 ms :[false, (NOT p1), false, (NOT p1), true]
Product exploration explored 100000 steps with 14327 reset in 847 ms.
Product exploration explored 100000 steps with 14281 reset in 885 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 188 ms :[false, (NOT p1), false, (NOT p1), true]
Support contains 1 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 24 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:41:24] [INFO ] Redundant transitions in 4 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 08:41:24] [INFO ] Invariant cache hit.
[2024-06-07 08:41:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:42:21] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:42:21] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
[2024-06-07 08:42:22] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 1 ms to minimize.
[2024-06-07 08:42:22] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 1 ms to minimize.
[2024-06-07 08:42:23] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 08:42:24] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 1 ms to minimize.
[2024-06-07 08:42:24] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 08:42:24] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:42:24] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-06-07 08:42:25] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-07 08:42:25] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
[2024-06-07 08:42:25] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:42:26] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-07 08:42:27] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 08:42:28] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:42:28] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
SMT process timed out in 64151ms, After SMT, problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 64158ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64197 ms. Remains : 361/361 places, 649/649 transitions.
Built C files in :
/tmp/ltsmin8901481981827159060
[2024-06-07 08:42:28] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8901481981827159060
Running compilation step : cd /tmp/ltsmin8901481981827159060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1370 ms.
Running link step : cd /tmp/ltsmin8901481981827159060;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin8901481981827159060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7805395682698905688.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 12 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 08:42:43] [INFO ] Invariant cache hit.
[2024-06-07 08:42:43] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-06-07 08:42:43] [INFO ] Invariant cache hit.
[2024-06-07 08:42:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:42:44] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 08:42:44] [INFO ] Invariant cache hit.
[2024-06-07 08:42:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 08:43:40] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-06-07 08:43:40] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
[2024-06-07 08:43:40] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 1 ms to minimize.
[2024-06-07 08:43:41] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 1 ms to minimize.
[2024-06-07 08:43:42] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 08:43:42] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 2 ms to minimize.
[2024-06-07 08:43:42] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 08:43:43] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-07 08:43:43] [INFO ] Deduced a trap composed of 96 places in 90 ms of which 1 ms to minimize.
[2024-06-07 08:43:43] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-06-07 08:43:43] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-06-07 08:43:44] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 08:43:45] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2024-06-07 08:43:46] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 08:43:46] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:43:47] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63852ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63859ms
Finished structural reductions in LTL mode , in 1 iterations and 64447 ms. Remains : 361/361 places, 649/649 transitions.
Built C files in :
/tmp/ltsmin8073784798265096947
[2024-06-07 08:43:47] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8073784798265096947
Running compilation step : cd /tmp/ltsmin8073784798265096947;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1317 ms.
Running link step : cd /tmp/ltsmin8073784798265096947;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8073784798265096947;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15077429545902284906.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-07 08:44:03] [INFO ] Flatten gal took : 26 ms
[2024-06-07 08:44:03] [INFO ] Flatten gal took : 24 ms
[2024-06-07 08:44:03] [INFO ] Time to serialize gal into /tmp/LTL14038625824523170938.gal : 6 ms
[2024-06-07 08:44:03] [INFO ] Time to serialize properties into /tmp/LTL15195513593926624045.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14038625824523170938.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2704502801178679786.hoa' '-atoms' '/tmp/LTL15195513593926624045.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15195513593926624045.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2704502801178679786.hoa
Detected timeout of ITS tools.
[2024-06-07 08:44:18] [INFO ] Flatten gal took : 20 ms
[2024-06-07 08:44:18] [INFO ] Flatten gal took : 20 ms
[2024-06-07 08:44:18] [INFO ] Time to serialize gal into /tmp/LTL8049535212499084826.gal : 4 ms
[2024-06-07 08:44:18] [INFO ] Time to serialize properties into /tmp/LTL2098932608268121541.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8049535212499084826.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2098932608268121541.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((("(pred_arm_empty_0<=(((((pred_holding_0+pred_holding_1)+(pred_holding_2+pred_holding_3))+((pred_holding_4+pred_holding_5)+(pred_ho...424
Formula 0 simplified : !"(pred_arm_empty_0<=(((((pred_holding_0+pred_holding_1)+(pred_holding_2+pred_holding_3))+((pred_holding_4+pred_holding_5)+(pred_hol...415
Detected timeout of ITS tools.
[2024-06-07 08:44:33] [INFO ] Flatten gal took : 25 ms
[2024-06-07 08:44:33] [INFO ] Applying decomposition
[2024-06-07 08:44:33] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3458679907251494624.txt' '-o' '/tmp/graph3458679907251494624.bin' '-w' '/tmp/graph3458679907251494624.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3458679907251494624.bin' '-l' '-1' '-v' '-w' '/tmp/graph3458679907251494624.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:44:33] [INFO ] Decomposing Gal with order
[2024-06-07 08:44:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:44:33] [INFO ] Removed a total of 592 redundant transitions.
[2024-06-07 08:44:33] [INFO ] Flatten gal took : 208 ms
[2024-06-07 08:44:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 1752 labels/synchronizations in 61 ms.
[2024-06-07 08:44:33] [INFO ] Time to serialize gal into /tmp/LTL7850601280777460911.gal : 3 ms
[2024-06-07 08:44:33] [INFO ] Time to serialize properties into /tmp/LTL17973403532396910767.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7850601280777460911.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17973403532396910767.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((("(gu3.pred_arm_empty_0<=(((((gu3.pred_holding_0+gu3.pred_holding_1)+(gu3.pred_holding_2+gu3.pred_holding_3))+((gu3.pred_holding_4+...508
Formula 0 simplified : !"(gu3.pred_arm_empty_0<=(((((gu3.pred_holding_0+gu3.pred_holding_1)+(gu3.pred_holding_2+gu3.pred_holding_3))+((gu3.pred_holding_4+g...499
Detected timeout of ITS tools.
Treatment of property BlocksWorld-PT-03-LTLCardinality-07 finished in 339245 ms.
[2024-06-07 08:44:48] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16735065866465923910
[2024-06-07 08:44:48] [INFO ] Computing symmetric may disable matrix : 649 transitions.
[2024-06-07 08:44:48] [INFO ] Applying decomposition
[2024-06-07 08:44:48] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-07 08:44:48] [INFO ] Flatten gal took : 20 ms
[2024-06-07 08:44:48] [INFO ] Computing symmetric may enable matrix : 649 transitions.
[2024-06-07 08:44:48] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3545446457357683341.txt' '-o' '/tmp/graph3545446457357683341.bin' '-w' '/tmp/graph3545446457357683341.weights'
[2024-06-07 08:44:49] [INFO ] Computing Do-Not-Accords matrix : 649 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3545446457357683341.bin' '-l' '-1' '-v' '-w' '/tmp/graph3545446457357683341.weights' '-q' '0' '-e' '0.001'
[2024-06-07 08:44:49] [INFO ] Decomposing Gal with order
[2024-06-07 08:44:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 08:44:49] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-07 08:44:49] [INFO ] Built C files in 182ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16735065866465923910
Running compilation step : cd /tmp/ltsmin16735065866465923910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-06-07 08:44:49] [INFO ] Removed a total of 596 redundant transitions.
[2024-06-07 08:44:49] [INFO ] Flatten gal took : 229 ms
[2024-06-07 08:44:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 612 labels/synchronizations in 12 ms.
[2024-06-07 08:44:49] [INFO ] Time to serialize gal into /tmp/LTLCardinality10311156039761667842.gal : 4 ms
[2024-06-07 08:44:49] [INFO ] Time to serialize properties into /tmp/LTLCardinality3777865196082776784.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10311156039761667842.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3777865196082776784.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((G(F("((((((gu3.pred_holding_0+gu3.pred_holding_1)+(gu3.pred_holding_2+gu3.pred_holding_3))+((gu3.pred_holding_4+gu3.pred_holding_5)...422
Formula 0 simplified : FG!"((((((gu3.pred_holding_0+gu3.pred_holding_1)+(gu3.pred_holding_2+gu3.pred_holding_3))+((gu3.pred_holding_4+gu3.pred_holding_5)+(...416
Compilation finished in 2323 ms.
Running link step : cd /tmp/ltsmin16735065866465923910;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin16735065866465923910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin16735065866465923910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16735065866465923910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp1==true) U []((!(LTLAPp2==true)||X(X((LTLAPp2==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.115: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.115: LTL layer: formula: ((LTLAPp1==true) U []((!(LTLAPp2==true)||X(X((LTLAPp2==true))))))
pins2lts-mc-linux64( 0/ 8), 0.115: "((LTLAPp1==true) U []((!(LTLAPp2==true)||X(X((LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.115: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.117: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.123: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.124: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.125: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.130: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.135: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.134: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.141: buchi has 10 states
pins2lts-mc-linux64( 0/ 8), 0.264: There are 653 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.264: State length is 362, there are 668 groups
pins2lts-mc-linux64( 0/ 8), 0.265: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.265: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.265: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.265: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.299: [Blue] ~38 levels ~960 states ~2896 transitions
pins2lts-mc-linux64( 2/ 8), 0.339: [Blue] ~78 levels ~1920 states ~5184 transitions
pins2lts-mc-linux64( 2/ 8), 0.414: [Blue] ~147 levels ~3840 states ~10232 transitions
pins2lts-mc-linux64( 7/ 8), 0.550: [Blue] ~269 levels ~7680 states ~23608 transitions
pins2lts-mc-linux64( 2/ 8), 0.822: [Blue] ~595 levels ~15360 states ~42712 transitions
pins2lts-mc-linux64( 1/ 8), 1.237: [Blue] ~1193 levels ~30720 states ~82192 transitions
pins2lts-mc-linux64( 1/ 8), 1.967: [Blue] ~2297 levels ~61440 states ~171040 transitions
pins2lts-mc-linux64( 1/ 8), 3.260: [Blue] ~4583 levels ~122880 states ~337216 transitions
pins2lts-mc-linux64( 1/ 8), 5.451: [Blue] ~9391 levels ~245760 states ~659344 transitions
pins2lts-mc-linux64( 1/ 8), 9.443: [Blue] ~18737 levels ~491520 states ~1319784 transitions
pins2lts-mc-linux64( 1/ 8), 17.013: [Blue] ~37709 levels ~983040 states ~2608312 transitions
pins2lts-mc-linux64( 1/ 8), 31.826: [Blue] ~75229 levels ~1966080 states ~5252136 transitions
pins2lts-mc-linux64( 1/ 8), 61.633: [Blue] ~148887 levels ~3932160 states ~10589448 transitions
pins2lts-mc-linux64( 5/ 8), 122.292: [Blue] ~302426 levels ~7864320 states ~22888336 transitions
pins2lts-mc-linux64( 3/ 8), 156.441: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 156.671:
pins2lts-mc-linux64( 0/ 8), 156.672: Explored 9749379 states 28881656 transitions, fanout: 2.962
pins2lts-mc-linux64( 0/ 8), 156.672: Total exploration time 156.400 sec (156.180 sec minimum, 156.246 sec on average)
pins2lts-mc-linux64( 0/ 8), 156.672: States per second: 62336, Transitions per second: 184665
pins2lts-mc-linux64( 0/ 8), 156.672:
pins2lts-mc-linux64( 0/ 8), 156.672: State space has 20795340 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 156.672: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 156.672: blue states: 9749379 (46.88%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 156.672: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 156.672: all-red states: 6833453 (32.86%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 156.672:
pins2lts-mc-linux64( 0/ 8), 156.672: Total memory used for local state coloring: 44.4MB
pins2lts-mc-linux64( 0/ 8), 156.672:
pins2lts-mc-linux64( 0/ 8), 156.672: Queue width: 8B, total height: 2909906, memory: 22.20MB
pins2lts-mc-linux64( 0/ 8), 156.672: Tree memory: 414.7MB, 20.9 B/state, compr.: 1.4%
pins2lts-mc-linux64( 0/ 8), 156.672: Tree fill ratio (roots/leafs): 15.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 156.672: Stored 683 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 156.672: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 156.672: Est. total memory use: 436.9MB (~1046.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16735065866465923910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp1==true) U []((!(LTLAPp2==true)||X(X((LTLAPp2==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16735065866465923910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp1==true) U []((!(LTLAPp2==true)||X(X((LTLAPp2==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-06-07 09:06:09] [INFO ] Applying decomposition
[2024-06-07 09:06:09] [INFO ] Flatten gal took : 21 ms
[2024-06-07 09:06:09] [INFO ] Decomposing Gal with order
[2024-06-07 09:06:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 09:06:09] [INFO ] Removed a total of 1834 redundant transitions.
[2024-06-07 09:06:09] [INFO ] Flatten gal took : 75 ms
[2024-06-07 09:06:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-06-07 09:06:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality840251585613148151.gal : 8 ms
[2024-06-07 09:06:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality8071811377268282515.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality840251585613148151.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8071811377268282515.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 2 LTL properties
Checking formula 0 : !((G(F("((((((gu2.pred_holding_0+gu5.pred_holding_1)+(gu6.pred_holding_2+gu8.pred_holding_3))+((gu11.pred_holding_4+gu17.pred_holding_...431
Formula 0 simplified : FG!"((((((gu2.pred_holding_0+gu5.pred_holding_1)+(gu6.pred_holding_2+gu8.pred_holding_3))+((gu11.pred_holding_4+gu17.pred_holding_5)...425
ITS-tools command line returned an error code 137
[2024-06-07 09:16:57] [INFO ] Flatten gal took : 27 ms
[2024-06-07 09:16:58] [INFO ] Input system was already deterministic with 649 transitions.
[2024-06-07 09:16:58] [INFO ] Transformed 361 places.
[2024-06-07 09:16:58] [INFO ] Transformed 649 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-06-07 09:16:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality13409387421009563122.gal : 4 ms
[2024-06-07 09:16:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality1852035990577964214.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13409387421009563122.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1852035990577964214.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((((((pred_holding_0+pred_holding_1)+(pred_holding_2+pred_holding_3))+((pred_holding_4+pred_holding_5)+(pred_holding_6+pred_ho...350
Formula 0 simplified : FG!"((((((pred_holding_0+pred_holding_1)+(pred_holding_2+pred_holding_3))+((pred_holding_4+pred_holding_5)+(pred_holding_6+pred_hold...344

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="BlocksWorld-PT-03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BlocksWorld-PT-03, 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 r602-tall-171774424600179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-03.tgz
mv BlocksWorld-PT-03 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 ;