Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446800292.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-PT-S04J06T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446800292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 19K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Apr 11 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Apr 11 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 90K Apr 11 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 427K Apr 11 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.6M May 18 16:43 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 PolyORBLF-PT-S04J06T06-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S04J06T06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716918362530

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 17:46:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 17:46:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:46:04] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2024-05-28 17:46:04] [INFO ] Transformed 618 places.
[2024-05-28 17:46:04] [INFO ] Transformed 3190 transitions.
[2024-05-28 17:46:04] [INFO ] Parsed PT model containing 618 places and 3190 transitions and 21570 arcs in 326 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
[2024-05-28 17:46:04] [INFO ] Reduced 264 identical enabling conditions.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 212 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1564
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 9 place count 609 transition count 1559
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 609 transition count 1559
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 604 transition count 1554
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 604 transition count 1554
Applied a total of 24 rules in 110 ms. Remains 604 /618 variables (removed 14) and now considering 1554/1564 (removed 10) transitions.
Running 1550 sub problems to find dead transitions.
[2024-05-28 17:46:04] [INFO ] Flow matrix only has 1530 transitions (discarded 24 similar events)
// Phase 1: matrix 1530 rows 604 cols
[2024-05-28 17:46:04] [INFO ] Computed 50 invariants in 99 ms
[2024-05-28 17:46:04] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 26/44 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
[2024-05-28 17:46:22] [INFO ] Deduced a trap composed of 135 places in 199 ms of which 20 ms to minimize.
[2024-05-28 17:46:23] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-28 17:46:24] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 1 ms to minimize.
[2024-05-28 17:46:25] [INFO ] Deduced a trap composed of 292 places in 220 ms of which 3 ms to minimize.
[2024-05-28 17:46:25] [INFO ] Deduced a trap composed of 279 places in 212 ms of which 3 ms to minimize.
[2024-05-28 17:46:26] [INFO ] Deduced a trap composed of 284 places in 302 ms of which 4 ms to minimize.
[2024-05-28 17:46:26] [INFO ] Deduced a trap composed of 300 places in 266 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 10.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.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 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.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 1.0)
(s87 0.0)
(s88 1.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 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 2.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.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 1.0)
(s173 0.0)
(s174 2.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 2.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.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 timeout
0.0)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 600/2134 variables, and 51 constraints, problems are : Problem set: 0 solved, 1550 unsolved in 20081 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 26/32 constraints, State Equation: 0/604 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1550/1550 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1550 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 26/44 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/600 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
[2024-05-28 17:46:41] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 4 ms to minimize.
[2024-05-28 17:46:42] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 1 ms to minimize.
[2024-05-28 17:46:42] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 1 ms to minimize.
[2024-05-28 17:46:42] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:46:43] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 2 ms to minimize.
[2024-05-28 17:46:43] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 2 ms to minimize.
[2024-05-28 17:46:45] [INFO ] Deduced a trap composed of 258 places in 330 ms of which 5 ms to minimize.
[2024-05-28 17:46:46] [INFO ] Deduced a trap composed of 102 places in 248 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/2134 variables, and 59 constraints, problems are : Problem set: 0 solved, 1550 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 26/32 constraints, State Equation: 0/604 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1550 constraints, Known Traps: 15/15 constraints]
After SMT, in 45078ms problems are : Problem set: 0 solved, 1550 unsolved
Search for dead transitions found 0 dead transitions in 45135ms
[2024-05-28 17:46:49] [INFO ] Flow matrix only has 1530 transitions (discarded 24 similar events)
[2024-05-28 17:46:49] [INFO ] Invariant cache hit.
[2024-05-28 17:46:50] [INFO ] Implicit Places using invariants in 448 ms returned [134, 199, 326, 360, 479, 546]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 458 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 598/618 places, 1554/1564 transitions.
Applied a total of 0 rules in 13 ms. Remains 598 /598 variables (removed 0) and now considering 1554/1554 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45770 ms. Remains : 598/618 places, 1554/1564 transitions.
Support contains 212 out of 598 places after structural reductions.
[2024-05-28 17:46:50] [INFO ] Flatten gal took : 175 ms
[2024-05-28 17:46:50] [INFO ] Flatten gal took : 107 ms
[2024-05-28 17:46:50] [INFO ] Input system was already deterministic with 1554 transitions.
RANDOM walk for 40000 steps (11 resets) in 1768 ms. (22 steps per ms) remains 3/25 properties
BEST_FIRST walk for 40003 steps (8 resets) in 992 ms. (40 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 275 ms. (144 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 347 ms. (114 steps per ms) remains 3/3 properties
[2024-05-28 17:46:51] [INFO ] Flow matrix only has 1530 transitions (discarded 24 similar events)
// Phase 1: matrix 1530 rows 598 cols
[2024-05-28 17:46:51] [INFO ] Computed 44 invariants in 48 ms
[2024-05-28 17:46:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 15/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp22 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 509/548 variables, 12/16 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/568 variables, 12/28 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 0/28 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp18 is UNSAT
After SMT solving in domain Real declared 596/2128 variables, and 43 constraints, problems are : Problem set: 3 solved, 0 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/598 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 587ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-12 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(F(p0))))'
Support contains 6 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1553
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1552
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 50 ms. Remains 596 /598 variables (removed 2) and now considering 1552/1554 (removed 2) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 17:46:52] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 17:46:52] [INFO ] Computed 44 invariants in 30 ms
[2024-05-28 17:46:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 17:47:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 30 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 12/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/31 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 6/37 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-05-28 17:47:35] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 45202ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 45223ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-05-28 17:47:38] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 17:47:38] [INFO ] Computed 44 invariants in 19 ms
[2024-05-28 17:47:38] [INFO ] Implicit Places using invariants in 569 ms returned []
[2024-05-28 17:47:38] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:47:38] [INFO ] Invariant cache hit.
[2024-05-28 17:47:39] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:47:53] [INFO ] Implicit Places using invariants and state equation in 15143 ms returned []
Implicit Place search using SMT with State Equation took 15714 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1462/1554 transitions.
Applied a total of 0 rules in 17 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61012 ms. Remains : 596/598 places, 1462/1554 transitions.
Stuttering acceptance computed with spot in 318 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-00
Stuttering criterion allowed to conclude after 10643 steps with 7 reset in 88 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-00 finished in 61471 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)||(G(p1)&&(G(p2)||(X(p2)&&F(p3)))))))'
Support contains 56 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1553
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1552
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 63 ms. Remains 596 /598 variables (removed 2) and now considering 1552/1554 (removed 2) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 17:47:54] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 17:47:54] [INFO ] Computed 44 invariants in 29 ms
[2024-05-28 17:47:54] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 17:48:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 30 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 12/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/31 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 6/37 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-05-28 17:48:34] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 44797ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 44816ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-05-28 17:48:39] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 17:48:39] [INFO ] Computed 44 invariants in 19 ms
[2024-05-28 17:48:39] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-05-28 17:48:39] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:48:39] [INFO ] Invariant cache hit.
[2024-05-28 17:48:40] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:48:58] [INFO ] Implicit Places using invariants and state equation in 19300 ms returned []
Implicit Place search using SMT with State Equation took 19710 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1462/1554 transitions.
Applied a total of 0 rules in 10 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64614 ms. Remains : 596/598 places, 1462/1554 transitions.
Stuttering acceptance computed with spot in 509 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p1), (AND p1 (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p2) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-04
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-04 finished in 65170 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((X((F(p0) U X(p1)))&&F(p2))))'
Support contains 38 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1553
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1552
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 38 ms. Remains 596 /598 variables (removed 2) and now considering 1552/1554 (removed 2) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 17:48:59] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 17:48:59] [INFO ] Computed 44 invariants in 36 ms
[2024-05-28 17:48:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 17:49:15] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 30 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 12/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/31 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 6/37 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-05-28 17:49:39] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
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 Int declared 593/2124 variables, and 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 44686ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 44716ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-05-28 17:49:44] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 17:49:44] [INFO ] Computed 44 invariants in 20 ms
[2024-05-28 17:49:44] [INFO ] Implicit Places using invariants in 515 ms returned []
[2024-05-28 17:49:44] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:49:44] [INFO ] Invariant cache hit.
[2024-05-28 17:49:45] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:49:58] [INFO ] Implicit Places using invariants and state equation in 14312 ms returned []
Implicit Place search using SMT with State Equation took 14841 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1462/1554 transitions.
Applied a total of 0 rules in 7 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59607 ms. Remains : 596/598 places, 1462/1554 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-05
Product exploration explored 100000 steps with 2785 reset in 666 ms.
Product exploration explored 100000 steps with 2773 reset in 542 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 p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 115 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 216 steps (0 resets) in 8 ms. (24 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 260 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-28 17:50:01] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:50:01] [INFO ] Invariant cache hit.
[2024-05-28 17:50:02] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2024-05-28 17:50:02] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 72 ms returned sat
[2024-05-28 17:50:05] [INFO ] [Real]Absence check using state equation in 2688 ms returned sat
[2024-05-28 17:50:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:50:06] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-28 17:50:06] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 69 ms returned sat
[2024-05-28 17:50:13] [INFO ] [Nat]Absence check using state equation in 6817 ms returned sat
[2024-05-28 17:50:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:50:14] [INFO ] [Nat]Added 120 Read/Feed constraints in 1368 ms returned sat
[2024-05-28 17:50:15] [INFO ] Deduced a trap composed of 82 places in 324 ms of which 5 ms to minimize.
[2024-05-28 17:50:15] [INFO ] Deduced a trap composed of 82 places in 163 ms of which 2 ms to minimize.
[2024-05-28 17:50:15] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 1 ms to minimize.
[2024-05-28 17:50:15] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:50:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1067 ms
[2024-05-28 17:50:15] [INFO ] Computed and/alt/rep : 1008/3943/990 causal constraints (skipped 444 transitions) in 161 ms.
[2024-05-28 17:50:20] [INFO ] Added : 125 causal constraints over 25 iterations in 4791 ms. Result :unknown
Could not prove EG (NOT p2)
[2024-05-28 17:50:20] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:50:20] [INFO ] Invariant cache hit.
[2024-05-28 17:50:21] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-28 17:50:21] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 63 ms returned sat
[2024-05-28 17:50:22] [INFO ] [Real]Absence check using state equation in 1495 ms returned sat
[2024-05-28 17:50:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:50:23] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-28 17:50:23] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 46 ms returned sat
[2024-05-28 17:50:27] [INFO ] [Nat]Absence check using state equation in 3983 ms returned sat
[2024-05-28 17:50:27] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:50:28] [INFO ] [Nat]Added 120 Read/Feed constraints in 618 ms returned sat
[2024-05-28 17:50:28] [INFO ] Deduced a trap composed of 133 places in 483 ms of which 8 ms to minimize.
[2024-05-28 17:50:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 839 ms
[2024-05-28 17:50:29] [INFO ] Computed and/alt/rep : 1008/3943/990 causal constraints (skipped 444 transitions) in 121 ms.
[2024-05-28 17:50:38] [INFO ] Added : 235 causal constraints over 47 iterations in 8884 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 38 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1462/1462 transitions.
Applied a total of 0 rules in 24 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Running 1458 sub problems to find dead transitions.
[2024-05-28 17:50:38] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:50:38] [INFO ] Invariant cache hit.
[2024-05-28 17:50:38] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 17:50:52] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:50:53] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 1 ms to minimize.
[2024-05-28 17:50:55] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2034 variables, and 35 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 17:51:05] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 2 ms to minimize.
[2024-05-28 17:51:05] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-05-28 17:51:05] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-28 17:51:05] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:51:06] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 2 ms to minimize.
[2024-05-28 17:51:06] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 3 ms to minimize.
[2024-05-28 17:51:06] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:51:18] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2034 variables, and 43 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 11/11 constraints]
After SMT, in 44426ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 44460ms
[2024-05-28 17:51:22] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:51:22] [INFO ] Invariant cache hit.
[2024-05-28 17:51:23] [INFO ] Implicit Places using invariants in 516 ms returned []
[2024-05-28 17:51:23] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:51:23] [INFO ] Invariant cache hit.
[2024-05-28 17:51:23] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:51:38] [INFO ] Implicit Places using invariants and state equation in 15793 ms returned []
Implicit Place search using SMT with State Equation took 16326 ms to find 0 implicit places.
Running 1458 sub problems to find dead transitions.
[2024-05-28 17:51:38] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:51:38] [INFO ] Invariant cache hit.
[2024-05-28 17:51:38] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 17:51:52] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 17:51:52] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:51:55] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1458 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 592/2034 variables, and 35 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 17:52:15] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
[2024-05-28 17:52:15] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-28 17:52:15] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-28 17:52:15] [INFO ] Deduced a trap composed of 82 places in 51 ms of which 0 ms to minimize.
[2024-05-28 17:52:15] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:52:15] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:52:16] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 1 ms to minimize.
[2024-05-28 17:52:26] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2034 variables, and 43 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 11/11 constraints]
After SMT, in 63941ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 63969ms
Finished structural reductions in LTL mode , in 1 iterations and 124797 ms. Remains : 596/596 places, 1462/1462 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 120 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 239 steps (0 resets) in 8 ms. (26 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 194 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-28 17:52:43] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:52:43] [INFO ] Invariant cache hit.
[2024-05-28 17:52:44] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-28 17:52:44] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 53 ms returned sat
[2024-05-28 17:52:47] [INFO ] [Real]Absence check using state equation in 2719 ms returned sat
[2024-05-28 17:52:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:52:48] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-28 17:52:48] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 49 ms returned sat
[2024-05-28 17:52:55] [INFO ] [Nat]Absence check using state equation in 7172 ms returned sat
[2024-05-28 17:52:55] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:52:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 17:52:58] [INFO ] [Nat]Added 120 Read/Feed constraints in 2247 ms returned sat
[2024-05-28 17:52:58] [INFO ] Deduced a trap composed of 82 places in 203 ms of which 3 ms to minimize.
[2024-05-28 17:52:58] [INFO ] Deduced a trap composed of 82 places in 162 ms of which 2 ms to minimize.
[2024-05-28 17:52:59] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 3 ms to minimize.
[2024-05-28 17:52:59] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-05-28 17:52:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1464 ms
[2024-05-28 17:52:59] [INFO ] Computed and/alt/rep : 1008/3943/990 causal constraints (skipped 444 transitions) in 118 ms.
Could not prove EG (NOT p2)
[2024-05-28 17:53:02] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:53:02] [INFO ] Invariant cache hit.
[2024-05-28 17:53:03] [INFO ] [Real]Absence check using 18 positive place invariants in 19 ms returned sat
[2024-05-28 17:53:03] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 91 ms returned sat
[2024-05-28 17:53:05] [INFO ] [Real]Absence check using state equation in 1545 ms returned sat
[2024-05-28 17:53:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:53:05] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-28 17:53:05] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 46 ms returned sat
[2024-05-28 17:53:09] [INFO ] [Nat]Absence check using state equation in 3808 ms returned sat
[2024-05-28 17:53:09] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:53:10] [INFO ] [Nat]Added 120 Read/Feed constraints in 492 ms returned sat
[2024-05-28 17:53:10] [INFO ] Deduced a trap composed of 133 places in 369 ms of which 5 ms to minimize.
[2024-05-28 17:53:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 705 ms
[2024-05-28 17:53:11] [INFO ] Computed and/alt/rep : 1008/3943/990 causal constraints (skipped 444 transitions) in 132 ms.
[2024-05-28 17:53:20] [INFO ] Added : 225 causal constraints over 45 iterations in 9291 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 2814 reset in 725 ms.
Product exploration explored 100000 steps with 2809 reset in 554 ms.
Applying partial POR strategy [false, false, true, false, true, true]
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 38 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 1462/1462 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 596 transition count 1462
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 36 place count 596 transition count 1462
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 48 place count 596 transition count 1462
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 60 place count 584 transition count 1450
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 72 place count 584 transition count 1450
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 132 places in 1 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 168 place count 584 transition count 1450
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 189 place count 563 transition count 1429
Deduced a syphon composed of 114 places in 2 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 210 place count 563 transition count 1429
Deduced a syphon composed of 114 places in 3 ms
Applied a total of 210 rules in 383 ms. Remains 563 /596 variables (removed 33) and now considering 1429/1462 (removed 33) transitions.
Running 1425 sub problems to find dead transitions.
[2024-05-28 17:53:22] [INFO ] Flow matrix only has 1405 transitions (discarded 24 similar events)
// Phase 1: matrix 1405 rows 563 cols
[2024-05-28 17:53:22] [INFO ] Computed 44 invariants in 20 ms
[2024-05-28 17:53:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/559 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/559 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 1425 unsolved
[2024-05-28 17:53:36] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-28 17:53:36] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 3 ms to minimize.
[2024-05-28 17:53:36] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD88 is UNSAT
[2024-05-28 17:53:37] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 8 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD236 is UNSAT
[2024-05-28 17:53:39] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
Problem TDEAD318 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD411 is UNSAT
[2024-05-28 17:53:40] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
Problem TDEAD414 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD586 is UNSAT
[2024-05-28 17:53:43] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
Problem TDEAD643 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD972 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 559/1968 variables, and 42 constraints, problems are : Problem set: 33 solved, 1392 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1425/1425 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 33 solved, 1392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/526 variables, 11/11 constraints. Problems are: Problem set: 33 solved, 1392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/526 variables, 10/21 constraints. Problems are: Problem set: 33 solved, 1392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/526 variables, 7/28 constraints. Problems are: Problem set: 33 solved, 1392 unsolved
[2024-05-28 17:53:56] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 1/29 constraints. Problems are: Problem set: 33 solved, 1392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/1968 variables, and 29 constraints, problems are : Problem set: 33 solved, 1392 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 10/27 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1425 constraints, Known Traps: 8/8 constraints]
After SMT, in 44467ms problems are : Problem set: 33 solved, 1392 unsolved
Search for dead transitions found 33 dead transitions in 44485ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 33 transitions.
[2024-05-28 17:54:07] [INFO ] Redundant transitions in 99 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 563/596 places, 1396/1462 transitions.
Graph (complete) has 3098 edges and 563 vertex of which 530 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.5 ms
Discarding 33 places :
Also discarding 0 output transitions
Deduced a syphon composed of 81 places in 2 ms
Applied a total of 1 rules in 51 ms. Remains 530 /563 variables (removed 33) and now considering 1396/1396 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 530/596 places, 1396/1462 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45032 ms. Remains : 530/596 places, 1396/1462 transitions.
Built C files in :
/tmp/ltsmin14382842215762885777
[2024-05-28 17:54:07] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14382842215762885777
Running compilation step : cd /tmp/ltsmin14382842215762885777;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14382842215762885777;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14382842215762885777;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 38 out of 596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 1462/1462 transitions.
Applied a total of 0 rules in 19 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Running 1458 sub problems to find dead transitions.
[2024-05-28 17:54:10] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 17:54:10] [INFO ] Computed 44 invariants in 30 ms
[2024-05-28 17:54:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 17:54:25] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:54:25] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 2 ms to minimize.
[2024-05-28 17:54:27] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2034 variables, and 35 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 17:54:46] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 1 ms to minimize.
[2024-05-28 17:54:46] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:54:46] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1458 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 Int declared 592/2034 variables, and 38 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 6/6 constraints]
After SMT, in 43756ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 43778ms
[2024-05-28 17:54:54] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:54:54] [INFO ] Invariant cache hit.
[2024-05-28 17:54:54] [INFO ] Implicit Places using invariants in 632 ms returned []
[2024-05-28 17:54:54] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:54:54] [INFO ] Invariant cache hit.
[2024-05-28 17:54:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:55:10] [INFO ] Implicit Places using invariants and state equation in 15116 ms returned []
Implicit Place search using SMT with State Equation took 15750 ms to find 0 implicit places.
Running 1458 sub problems to find dead transitions.
[2024-05-28 17:55:10] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:55:10] [INFO ] Invariant cache hit.
[2024-05-28 17:55:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 17:55:24] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:55:24] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 1 ms to minimize.
[2024-05-28 17:55:27] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2034 variables, and 35 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-05-28 17:55:47] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 2 ms to minimize.
[2024-05-28 17:55:47] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2024-05-28 17:55:47] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:55:47] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:55:47] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 2 ms to minimize.
[2024-05-28 17:55:47] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 1 ms to minimize.
[2024-05-28 17:55:47] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 2 ms to minimize.
[2024-05-28 17:55:58] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2034 variables, and 43 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 11/11 constraints]
After SMT, in 63991ms problems are : Problem set: 0 solved, 1458 unsolved
Search for dead transitions found 0 dead transitions in 64018ms
Finished structural reductions in LTL mode , in 1 iterations and 123578 ms. Remains : 596/596 places, 1462/1462 transitions.
Built C files in :
/tmp/ltsmin9075983083202515760
[2024-05-28 17:56:14] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9075983083202515760
Running compilation step : cd /tmp/ltsmin9075983083202515760;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9075983083202515760;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9075983083202515760;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 17:56:17] [INFO ] Flatten gal took : 80 ms
[2024-05-28 17:56:17] [INFO ] Flatten gal took : 74 ms
[2024-05-28 17:56:17] [INFO ] Time to serialize gal into /tmp/LTL129876530275979673.gal : 27 ms
[2024-05-28 17:56:17] [INFO ] Time to serialize properties into /tmp/LTL10764145804164542593.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/LTL129876530275979673.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7758112427529988624.hoa' '-atoms' '/tmp/LTL10764145804164542593.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/LTL10764145804164542593.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7758112427529988624.hoa
Detected timeout of ITS tools.
[2024-05-28 17:56:32] [INFO ] Flatten gal took : 70 ms
[2024-05-28 17:56:32] [INFO ] Flatten gal took : 67 ms
[2024-05-28 17:56:32] [INFO ] Time to serialize gal into /tmp/LTL12375096670230241083.gal : 13 ms
[2024-05-28 17:56:32] [INFO ] Time to serialize properties into /tmp/LTL14489160781637588481.ltl : 3 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/LTL12375096670230241083.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14489160781637588481.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...277
Read 1 LTL properties
Checking formula 0 : !((G((X((F("(((((((NoSigAbort>=1)&&(Abort_Check_Sources_B_3>=1))||((NoSigAbort>=1)&&(Abort_Check_Sources_B_4>=1)))||(((Abort_Check_Sou...1990
Formula 0 simplified : F(X(G!"(((((((NoSigAbort>=1)&&(Abort_Check_Sources_B_3>=1))||((NoSigAbort>=1)&&(Abort_Check_Sources_B_4>=1)))||(((Abort_Check_Source...1979
Detected timeout of ITS tools.
[2024-05-28 17:56:47] [INFO ] Flatten gal took : 51 ms
[2024-05-28 17:56:47] [INFO ] Applying decomposition
[2024-05-28 17:56:47] [INFO ] Flatten gal took : 51 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/graph14877983236566581278.txt' '-o' '/tmp/graph14877983236566581278.bin' '-w' '/tmp/graph14877983236566581278.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14877983236566581278.bin' '-l' '-1' '-v' '-w' '/tmp/graph14877983236566581278.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:56:48] [INFO ] Decomposing Gal with order
[2024-05-28 17:56:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:56:48] [INFO ] Removed a total of 1221 redundant transitions.
[2024-05-28 17:56:48] [INFO ] Flatten gal took : 209 ms
[2024-05-28 17:56:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 37 ms.
[2024-05-28 17:56:48] [INFO ] Time to serialize gal into /tmp/LTL16572457979207962744.gal : 18 ms
[2024-05-28 17:56:48] [INFO ] Time to serialize properties into /tmp/LTL14875319987651874860.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/LTL16572457979207962744.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14875319987651874860.ltl' '-c' '-stutter-deadlock'

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...256
Read 1 LTL properties
Checking formula 0 : !((G((X((F("(((((((i2.i0.u19.NoSigAbort>=1)&&(i2.i0.u19.Abort_Check_Sources_B_3>=1))||((i2.i0.u19.NoSigAbort>=1)&&(i2.i0.u19.Abort_Che...2569
Formula 0 simplified : F(X(G!"(((((((i2.i0.u19.NoSigAbort>=1)&&(i2.i0.u19.Abort_Check_Sources_B_3>=1))||((i2.i0.u19.NoSigAbort>=1)&&(i2.i0.u19.Abort_Check_...2558
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-05 finished in 484230 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&&X(!p1)) U (G((!p0&&X(!p1)))||(X(!p1)&&p2))))'
Support contains 90 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1553
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1552
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 45 ms. Remains 596 /598 variables (removed 2) and now considering 1552/1554 (removed 2) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 17:57:03] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 17:57:03] [INFO ] Computed 44 invariants in 54 ms
[2024-05-28 17:57:03] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 17:57:20] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 30 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 12/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/31 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 6/37 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-05-28 17:57:47] [INFO ] Deduced a trap composed of 98 places in 156 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 45120ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 45140ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-05-28 17:57:48] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 17:57:48] [INFO ] Computed 44 invariants in 23 ms
[2024-05-28 17:57:49] [INFO ] Implicit Places using invariants in 493 ms returned []
[2024-05-28 17:57:49] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:57:49] [INFO ] Invariant cache hit.
[2024-05-28 17:57:50] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:58:03] [INFO ] Implicit Places using invariants and state equation in 14300 ms returned []
Implicit Place search using SMT with State Equation took 14796 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1462/1554 transitions.
Applied a total of 0 rules in 7 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59993 ms. Remains : 596/598 places, 1462/1554 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR p1 (AND p0 (NOT p2))), true, p1]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 1645 ms.
Product exploration explored 100000 steps with 50000 reset in 1128 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 p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (OR p2 (NOT p0))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (OR p2 (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 30 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-06 finished in 62960 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(p0)||X(F((p1&&G(F(p2)))))))'
Support contains 8 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1553
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1552
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 26 ms. Remains 596 /598 variables (removed 2) and now considering 1552/1554 (removed 2) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 17:58:06] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 17:58:06] [INFO ] Computed 44 invariants in 41 ms
[2024-05-28 17:58:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 17:58:23] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 30 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 12/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/31 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 6/37 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-05-28 17:58:51] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 45921ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 45938ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-05-28 17:58:52] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 17:58:52] [INFO ] Computed 44 invariants in 32 ms
[2024-05-28 17:58:53] [INFO ] Implicit Places using invariants in 707 ms returned []
[2024-05-28 17:58:53] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 17:58:53] [INFO ] Invariant cache hit.
[2024-05-28 17:58:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:59:08] [INFO ] Implicit Places using invariants and state equation in 15085 ms returned []
Implicit Place search using SMT with State Equation took 15799 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1462/1554 transitions.
Applied a total of 0 rules in 20 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61789 ms. Remains : 596/598 places, 1462/1554 transitions.
Stuttering acceptance computed with spot in 353 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-08
Stuttering criterion allowed to conclude after 5304 steps with 7 reset in 35 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-08 finished in 62221 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)))'
Support contains 2 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 598 transition count 1512
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 85 place count 556 transition count 1511
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 555 transition count 1511
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 86 place count 555 transition count 1439
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 230 place count 483 transition count 1439
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 350 place count 423 transition count 1379
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 353 place count 420 transition count 1376
Iterating global reduction 3 with 3 rules applied. Total rules applied 356 place count 420 transition count 1376
Applied a total of 356 rules in 155 ms. Remains 420 /598 variables (removed 178) and now considering 1376/1554 (removed 178) transitions.
Running 1372 sub problems to find dead transitions.
[2024-05-28 17:59:08] [INFO ] Flow matrix only has 1352 transitions (discarded 24 similar events)
// Phase 1: matrix 1352 rows 420 cols
[2024-05-28 17:59:09] [INFO ] Computed 44 invariants in 34 ms
[2024-05-28 17:59:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
[2024-05-28 17:59:22] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-05-28 17:59:23] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 2 ms to minimize.
[2024-05-28 17:59:23] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/1772 variables, and 38 constraints, problems are : Problem set: 0 solved, 1372 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 19/28 constraints, State Equation: 0/420 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1372/1372 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
[2024-05-28 17:59:36] [INFO ] Deduced a trap composed of 35 places in 241 ms of which 2 ms to minimize.
[2024-05-28 17:59:36] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 2 ms to minimize.
[2024-05-28 17:59:36] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-05-28 17:59:36] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 1 ms to minimize.
[2024-05-28 17:59:41] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:59:41] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:59:41] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:59:42] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/416 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
[2024-05-28 17:59:53] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/1772 variables, and 47 constraints, problems are : Problem set: 0 solved, 1372 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 19/28 constraints, State Equation: 0/420 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1372 constraints, Known Traps: 12/12 constraints]
After SMT, in 45752ms problems are : Problem set: 0 solved, 1372 unsolved
Search for dead transitions found 0 dead transitions in 45770ms
[2024-05-28 17:59:54] [INFO ] Flow matrix only has 1352 transitions (discarded 24 similar events)
[2024-05-28 17:59:54] [INFO ] Invariant cache hit.
[2024-05-28 17:59:55] [INFO ] Implicit Places using invariants in 590 ms returned []
[2024-05-28 17:59:55] [INFO ] Flow matrix only has 1352 transitions (discarded 24 similar events)
[2024-05-28 17:59:55] [INFO ] Invariant cache hit.
[2024-05-28 17:59:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 18:00:04] [INFO ] Implicit Places using invariants and state equation in 8862 ms returned []
Implicit Place search using SMT with State Equation took 9455 ms to find 0 implicit places.
[2024-05-28 18:00:04] [INFO ] Redundant transitions in 69 ms returned []
Running 1372 sub problems to find dead transitions.
[2024-05-28 18:00:04] [INFO ] Flow matrix only has 1352 transitions (discarded 24 similar events)
[2024-05-28 18:00:04] [INFO ] Invariant cache hit.
[2024-05-28 18:00:04] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
[2024-05-28 18:00:17] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2024-05-28 18:00:18] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/416 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
SMT process timed out in 35802ms, After SMT, problems are : Problem set: 0 solved, 1372 unsolved
Search for dead transitions found 0 dead transitions in 35815ms
Starting structural reductions in SI_LTL mode, iteration 1 : 420/598 places, 1376/1554 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91282 ms. Remains : 420/598 places, 1376/1554 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-09
Stuttering criterion allowed to conclude after 2647 steps with 0 reset in 11 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-09 finished in 91359 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||X((p1&&G(p2)))))))'
Support contains 7 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1553
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1552
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 26 ms. Remains 596 /598 variables (removed 2) and now considering 1552/1554 (removed 2) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 18:00:40] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 18:00:40] [INFO ] Computed 44 invariants in 20 ms
[2024-05-28 18:00:40] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 18:00:56] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 30 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 12/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/31 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 6/37 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-05-28 18:01:23] [INFO ] Deduced a trap composed of 98 places in 155 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 45785ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 45800ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-05-28 18:01:25] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 18:01:26] [INFO ] Computed 44 invariants in 42 ms
[2024-05-28 18:01:26] [INFO ] Implicit Places using invariants in 691 ms returned []
[2024-05-28 18:01:26] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 18:01:26] [INFO ] Invariant cache hit.
[2024-05-28 18:01:27] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 18:01:41] [INFO ] Implicit Places using invariants and state equation in 15069 ms returned []
Implicit Place search using SMT with State Equation took 15762 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1462/1554 transitions.
Applied a total of 0 rules in 8 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61599 ms. Remains : 596/598 places, 1462/1554 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-11
Stuttering criterion allowed to conclude after 24125 steps with 0 reset in 111 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-11 finished in 61856 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||X(G(p1))))))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Applied a total of 0 rules in 9 ms. Remains 598 /598 variables (removed 0) and now considering 1554/1554 (removed 0) transitions.
Running 1550 sub problems to find dead transitions.
[2024-05-28 18:01:42] [INFO ] Flow matrix only has 1530 transitions (discarded 24 similar events)
// Phase 1: matrix 1530 rows 598 cols
[2024-05-28 18:01:42] [INFO ] Computed 44 invariants in 25 ms
[2024-05-28 18:01:42] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
[2024-05-28 18:01:59] [INFO ] Deduced a trap composed of 124 places in 246 ms of which 4 ms to minimize.
[2024-05-28 18:02:00] [INFO ] Deduced a trap composed of 160 places in 233 ms of which 3 ms to minimize.
[2024-05-28 18:02:00] [INFO ] Deduced a trap composed of 135 places in 205 ms of which 3 ms to minimize.
[2024-05-28 18:02:00] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 2 ms to minimize.
[2024-05-28 18:02:01] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 2 ms to minimize.
[2024-05-28 18:02:02] [INFO ] Deduced a trap composed of 290 places in 229 ms of which 3 ms to minimize.
[2024-05-28 18:02:03] [INFO ] Deduced a trap composed of 286 places in 230 ms of which 3 ms to minimize.
[2024-05-28 18:02:03] [INFO ] Deduced a trap composed of 283 places in 243 ms of which 3 ms to minimize.
[2024-05-28 18:02:04] [INFO ] Deduced a trap composed of 295 places in 233 ms of which 3 ms to minimize.
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 594/2128 variables, and 48 constraints, problems are : Problem set: 0 solved, 1550 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 22/27 constraints, State Equation: 0/598 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1550/1550 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1550 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
[2024-05-28 18:02:18] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 2 ms to minimize.
[2024-05-28 18:02:18] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 2 ms to minimize.
[2024-05-28 18:02:18] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/2128 variables, and 51 constraints, problems are : Problem set: 0 solved, 1550 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 22/27 constraints, State Equation: 0/598 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1550 constraints, Known Traps: 12/12 constraints]
After SMT, in 45798ms problems are : Problem set: 0 solved, 1550 unsolved
Search for dead transitions found 0 dead transitions in 45819ms
[2024-05-28 18:02:27] [INFO ] Flow matrix only has 1530 transitions (discarded 24 similar events)
[2024-05-28 18:02:27] [INFO ] Invariant cache hit.
[2024-05-28 18:02:28] [INFO ] Implicit Places using invariants in 674 ms returned []
[2024-05-28 18:02:28] [INFO ] Flow matrix only has 1530 transitions (discarded 24 similar events)
[2024-05-28 18:02:28] [INFO ] Invariant cache hit.
[2024-05-28 18:02:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 18:02:41] [INFO ] Implicit Places using invariants and state equation in 12546 ms returned []
Implicit Place search using SMT with State Equation took 13224 ms to find 0 implicit places.
Running 1550 sub problems to find dead transitions.
[2024-05-28 18:02:41] [INFO ] Flow matrix only has 1530 transitions (discarded 24 similar events)
[2024-05-28 18:02:41] [INFO ] Invariant cache hit.
[2024-05-28 18:02:41] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
[2024-05-28 18:02:57] [INFO ] Deduced a trap composed of 124 places in 243 ms of which 3 ms to minimize.
[2024-05-28 18:02:57] [INFO ] Deduced a trap composed of 157 places in 181 ms of which 2 ms to minimize.
[2024-05-28 18:02:58] [INFO ] Deduced a trap composed of 135 places in 250 ms of which 3 ms to minimize.
[2024-05-28 18:02:58] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 2 ms to minimize.
[2024-05-28 18:02:59] [INFO ] Deduced a trap composed of 291 places in 311 ms of which 4 ms to minimize.
[2024-05-28 18:03:00] [INFO ] Deduced a trap composed of 284 places in 349 ms of which 4 ms to minimize.
[2024-05-28 18:03:00] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 1 ms to minimize.
[2024-05-28 18:03:01] [INFO ] Deduced a trap composed of 303 places in 237 ms of which 3 ms to minimize.
[2024-05-28 18:03:02] [INFO ] Deduced a trap composed of 300 places in 301 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/2128 variables, and 48 constraints, problems are : Problem set: 0 solved, 1550 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 22/27 constraints, State Equation: 0/598 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1550/1550 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1550 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
[2024-05-28 18:03:25] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2024-05-28 18:03:25] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 2 ms to minimize.
[2024-05-28 18:03:27] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 1 ms to minimize.
[2024-05-28 18:03:27] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2024-05-28 18:03:34] [INFO ] Deduced a trap composed of 296 places in 353 ms of which 4 ms to minimize.
[2024-05-28 18:03:34] [INFO ] Deduced a trap composed of 290 places in 266 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/2128 variables, and 54 constraints, problems are : Problem set: 0 solved, 1550 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 22/27 constraints, State Equation: 0/598 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1550 constraints, Known Traps: 15/15 constraints]
After SMT, in 65299ms problems are : Problem set: 0 solved, 1550 unsolved
Search for dead transitions found 0 dead transitions in 65315ms
Finished structural reductions in LTL mode , in 1 iterations and 124375 ms. Remains : 598/598 places, 1554/1554 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1446 steps with 0 reset in 13 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-13 finished in 124572 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(F(p0)))'
Support contains 1 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 1553
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 1553
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 596 transition count 1552
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 596 transition count 1552
Applied a total of 4 rules in 46 ms. Remains 596 /598 variables (removed 2) and now considering 1552/1554 (removed 2) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-28 18:03:46] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-05-28 18:03:46] [INFO ] Computed 44 invariants in 53 ms
[2024-05-28 18:03:46] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-28 18:04:04] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 30 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 12/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/592 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1543 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/593 variables, 1/31 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 6/37 constraints. Problems are: Problem set: 90 solved, 1458 unsolved
[2024-05-28 18:04:31] [INFO ] Deduced a trap composed of 98 places in 157 ms of which 2 ms to minimize.
(s55 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 10)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 3)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 1)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 1)
(s53 0)
(s54 0)
(s55 1timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/2124 variables, and 38 constraints, problems are : Problem set: 90 solved, 1458 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 18/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 2/2 constraints]
After SMT, in 45848ms problems are : Problem set: 90 solved, 1458 unsolved
Search for dead transitions found 90 dead transitions in 45868ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 90 transitions.
[2024-05-28 18:04:32] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
// Phase 1: matrix 1438 rows 596 cols
[2024-05-28 18:04:32] [INFO ] Computed 44 invariants in 18 ms
[2024-05-28 18:04:33] [INFO ] Implicit Places using invariants in 515 ms returned []
[2024-05-28 18:04:33] [INFO ] Flow matrix only has 1438 transitions (discarded 24 similar events)
[2024-05-28 18:04:33] [INFO ] Invariant cache hit.
[2024-05-28 18:04:34] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 18:04:48] [INFO ] Implicit Places using invariants and state equation in 15188 ms returned []
Implicit Place search using SMT with State Equation took 15709 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 596/598 places, 1462/1554 transitions.
Applied a total of 0 rules in 8 ms. Remains 596 /596 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61636 ms. Remains : 596/598 places, 1462/1554 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-15
Stuttering criterion allowed to conclude after 35241 steps with 143 reset in 129 ms.
FORMULA PolyORBLF-PT-S04J06T06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-15 finished in 61870 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((X((F(p0) U X(p1)))&&F(p2))))'
Found a Lengthening insensitive property : PolyORBLF-PT-S04J06T06-LTLFireability-05
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 38 out of 598 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 598/598 places, 1554/1554 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 598 transition count 1510
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 554 transition count 1510
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 88 place count 554 transition count 1462
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 184 place count 506 transition count 1462
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 292 place count 452 transition count 1408
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 295 place count 449 transition count 1405
Iterating global reduction 2 with 3 rules applied. Total rules applied 298 place count 449 transition count 1405
Applied a total of 298 rules in 70 ms. Remains 449 /598 variables (removed 149) and now considering 1405/1554 (removed 149) transitions.
Running 1401 sub problems to find dead transitions.
[2024-05-28 18:04:48] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
// Phase 1: matrix 1381 rows 449 cols
[2024-05-28 18:04:48] [INFO ] Computed 44 invariants in 21 ms
[2024-05-28 18:04:48] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 18:05:03] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-05-28 18:05:03] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 3 ms to minimize.
[2024-05-28 18:05:03] [INFO ] Deduced a trap composed of 55 places in 197 ms of which 3 ms to minimize.
[2024-05-28 18:05:05] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 1 ms to minimize.
[2024-05-28 18:05:11] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1830 variables, and 44 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 18:05:17] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2024-05-28 18:05:17] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 0 ms to minimize.
[2024-05-28 18:05:17] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
[2024-05-28 18:05:17] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 1 ms to minimize.
[2024-05-28 18:05:22] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1830 variables, and 49 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 10/10 constraints]
After SMT, in 45538ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 45554ms
[2024-05-28 18:05:34] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 18:05:34] [INFO ] Invariant cache hit.
[2024-05-28 18:05:35] [INFO ] Implicit Places using invariants in 590 ms returned []
[2024-05-28 18:05:35] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 18:05:35] [INFO ] Invariant cache hit.
[2024-05-28 18:05:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 18:05:44] [INFO ] Implicit Places using invariants and state equation in 9602 ms returned []
Implicit Place search using SMT with State Equation took 10194 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-05-28 18:05:44] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 18:05:44] [INFO ] Invariant cache hit.
[2024-05-28 18:05:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 18:05:58] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-28 18:05:59] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 2 ms to minimize.
[2024-05-28 18:05:59] [INFO ] Deduced a trap composed of 55 places in 162 ms of which 2 ms to minimize.
[2024-05-28 18:06:00] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 2 ms to minimize.
[2024-05-28 18:06:12] [INFO ] Deduced a trap composed of 160 places in 260 ms of which 4 ms to minimize.
[2024-05-28 18:06:12] [INFO ] Deduced a trap composed of 168 places in 237 ms of which 2 ms to minimize.
[2024-05-28 18:06:12] [INFO ] Deduced a trap composed of 156 places in 233 ms of which 2 ms to minimize.
[2024-05-28 18:06:13] [INFO ] Deduced a trap composed of 131 places in 237 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1830 variables, and 47 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 18:06:26] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 2 ms to minimize.
[2024-05-28 18:06:26] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2024-05-28 18:06:27] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 0 ms to minimize.
[2024-05-28 18:06:27] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2024-05-28 18:06:31] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 18:06:44] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2024-05-28 18:06:47] [INFO ] Deduced a trap composed of 164 places in 239 ms of which 3 ms to minimize.
[2024-05-28 18:06:47] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 2 ms to minimize.
[2024-05-28 18:06:48] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1830 variables, and 56 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 17/17 constraints]
After SMT, in 65228ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 65240ms
Starting structural reductions in LI_LTL mode, iteration 1 : 449/598 places, 1405/1554 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 121066 ms. Remains : 449/598 places, 1405/1554 transitions.
Running random walk in product with property : PolyORBLF-PT-S04J06T06-LTLFireability-05
Product exploration explored 100000 steps with 3319 reset in 513 ms.
Product exploration explored 100000 steps with 3312 reset in 806 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 p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 136 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 166 steps (0 resets) in 9 ms. (16 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 220 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-28 18:06:52] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 18:06:52] [INFO ] Invariant cache hit.
[2024-05-28 18:06:53] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-28 18:06:53] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 83 ms returned sat
[2024-05-28 18:06:54] [INFO ] [Real]Absence check using state equation in 1495 ms returned sat
[2024-05-28 18:06:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 18:06:55] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-28 18:06:55] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 149 ms returned sat
[2024-05-28 18:06:59] [INFO ] [Nat]Absence check using state equation in 4075 ms returned sat
[2024-05-28 18:06:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 18:07:00] [INFO ] [Nat]Added 120 Read/Feed constraints in 1274 ms returned sat
[2024-05-28 18:07:00] [INFO ] Computed and/alt/rep : 945/4246/927 causal constraints (skipped 450 transitions) in 106 ms.
[2024-05-28 18:07:03] [INFO ] Added : 5 causal constraints over 1 iterations in 2879 ms. Result :sat
Could not prove EG (NOT p2)
[2024-05-28 18:07:03] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 18:07:03] [INFO ] Invariant cache hit.
[2024-05-28 18:07:04] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-28 18:07:04] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 57 ms returned sat
[2024-05-28 18:07:05] [INFO ] [Real]Absence check using state equation in 1440 ms returned sat
[2024-05-28 18:07:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 18:07:06] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-28 18:07:06] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 56 ms returned sat
[2024-05-28 18:07:08] [INFO ] [Nat]Absence check using state equation in 1590 ms returned sat
[2024-05-28 18:07:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 18:07:08] [INFO ] [Nat]Added 120 Read/Feed constraints in 618 ms returned sat
[2024-05-28 18:07:08] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 2 ms to minimize.
[2024-05-28 18:07:09] [INFO ] Deduced a trap composed of 27 places in 337 ms of which 3 ms to minimize.
[2024-05-28 18:07:09] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-05-28 18:07:10] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2024-05-28 18:07:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1706 ms
[2024-05-28 18:07:10] [INFO ] Computed and/alt/rep : 945/4246/927 causal constraints (skipped 450 transitions) in 104 ms.
[2024-05-28 18:07:19] [INFO ] Added : 282 causal constraints over 57 iterations in 8687 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 38 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 1405/1405 transitions.
Applied a total of 0 rules in 16 ms. Remains 449 /449 variables (removed 0) and now considering 1405/1405 (removed 0) transitions.
Running 1401 sub problems to find dead transitions.
[2024-05-28 18:07:19] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 18:07:19] [INFO ] Invariant cache hit.
[2024-05-28 18:07:19] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 18:07:32] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2024-05-28 18:07:33] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 3 ms to minimize.
[2024-05-28 18:07:33] [INFO ] Deduced a trap composed of 55 places in 200 ms of which 2 ms to minimize.
[2024-05-28 18:07:34] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1830 variables, and 43 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 18:07:50] [INFO ] Deduced a trap composed of 168 places in 238 ms of which 3 ms to minimize.
[2024-05-28 18:07:50] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 1 ms to minimize.
[2024-05-28 18:07:50] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
[2024-05-28 18:07:51] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2024-05-28 18:07:51] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 2 ms to minimize.
[2024-05-28 18:07:53] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-05-28 18:07:53] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2024-05-28 18:08:03] [INFO ] Deduced a trap composed of 156 places in 258 ms of which 3 ms to minimize.
[2024-05-28 18:08:03] [INFO ] Deduced a trap composed of 142 places in 318 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1830 variables, and 52 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 13/13 constraints]
After SMT, in 45456ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 45481ms
[2024-05-28 18:08:04] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 18:08:04] [INFO ] Invariant cache hit.
[2024-05-28 18:08:05] [INFO ] Implicit Places using invariants in 622 ms returned []
[2024-05-28 18:08:05] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 18:08:05] [INFO ] Invariant cache hit.
[2024-05-28 18:08:06] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 18:08:14] [INFO ] Implicit Places using invariants and state equation in 9482 ms returned []
Implicit Place search using SMT with State Equation took 10119 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-05-28 18:08:14] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 18:08:14] [INFO ] Invariant cache hit.
[2024-05-28 18:08:14] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 18:08:29] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2024-05-28 18:08:29] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 2 ms to minimize.
[2024-05-28 18:08:30] [INFO ] Deduced a trap composed of 55 places in 173 ms of which 2 ms to minimize.
[2024-05-28 18:08:31] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 1 ms to minimize.
[2024-05-28 18:08:43] [INFO ] Deduced a trap composed of 160 places in 310 ms of which 4 ms to minimize.
[2024-05-28 18:08:43] [INFO ] Deduced a trap composed of 168 places in 252 ms of which 2 ms to minimize.
[2024-05-28 18:08:44] [INFO ] Deduced a trap composed of 156 places in 178 ms of which 2 ms to minimize.
[2024-05-28 18:08:44] [INFO ] Deduced a trap composed of 131 places in 261 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 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 445/1830 variables, and 47 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 18:08:57] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2024-05-28 18:08:57] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 2 ms to minimize.
[2024-05-28 18:08:57] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-05-28 18:08:57] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 1 ms to minimize.
[2024-05-28 18:09:02] [INFO ] Deduced a trap composed of 57 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 18:09:15] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2024-05-28 18:09:17] [INFO ] Deduced a trap composed of 164 places in 185 ms of which 2 ms to minimize.
[2024-05-28 18:09:18] [INFO ] Deduced a trap composed of 164 places in 282 ms of which 3 ms to minimize.
[2024-05-28 18:09:18] [INFO ] Deduced a trap composed of 162 places in 275 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1830 variables, and 56 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 17/17 constraints]
After SMT, in 65593ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 65610ms
Finished structural reductions in LTL mode , in 1 iterations and 121238 ms. Remains : 449/449 places, 1405/1405 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 166 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 168 steps (0 resets) in 10 ms. (15 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 279 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-28 18:09:21] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 18:09:21] [INFO ] Invariant cache hit.
[2024-05-28 18:09:22] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-28 18:09:22] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 56 ms returned sat
[2024-05-28 18:09:24] [INFO ] [Real]Absence check using state equation in 1512 ms returned sat
[2024-05-28 18:09:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 18:09:24] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-28 18:09:24] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 151 ms returned sat
[2024-05-28 18:09:29] [INFO ] [Nat]Absence check using state equation in 4211 ms returned sat
[2024-05-28 18:09:29] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 18:09:30] [INFO ] [Nat]Added 120 Read/Feed constraints in 1275 ms returned sat
[2024-05-28 18:09:30] [INFO ] Computed and/alt/rep : 945/4246/927 causal constraints (skipped 450 transitions) in 108 ms.
[2024-05-28 18:09:32] [INFO ] Added : 5 causal constraints over 1 iterations in 2411 ms. Result :sat
Could not prove EG (NOT p2)
[2024-05-28 18:09:32] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 18:09:32] [INFO ] Invariant cache hit.
[2024-05-28 18:09:33] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-28 18:09:33] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 59 ms returned sat
[2024-05-28 18:09:34] [INFO ] [Real]Absence check using state equation in 1410 ms returned sat
[2024-05-28 18:09:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 18:09:35] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-28 18:09:35] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 50 ms returned sat
[2024-05-28 18:09:36] [INFO ] [Nat]Absence check using state equation in 1371 ms returned sat
[2024-05-28 18:09:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 18:09:37] [INFO ] [Nat]Added 120 Read/Feed constraints in 604 ms returned sat
[2024-05-28 18:09:37] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-05-28 18:09:38] [INFO ] Deduced a trap composed of 27 places in 337 ms of which 3 ms to minimize.
[2024-05-28 18:09:38] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2024-05-28 18:09:39] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2024-05-28 18:09:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2038 ms
[2024-05-28 18:09:39] [INFO ] Computed and/alt/rep : 945/4246/927 causal constraints (skipped 450 transitions) in 100 ms.
[2024-05-28 18:09:47] [INFO ] Added : 282 causal constraints over 57 iterations in 7757 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 3301 reset in 674 ms.
Product exploration explored 100000 steps with 3325 reset in 753 ms.
Applying partial POR strategy [false, false, true, false, true, true]
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 38 out of 449 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 449/449 places, 1405/1405 transitions.
Applied a total of 0 rules in 47 ms. Remains 449 /449 variables (removed 0) and now considering 1405/1405 (removed 0) transitions.
Running 1401 sub problems to find dead transitions.
[2024-05-28 18:09:49] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 18:09:49] [INFO ] Invariant cache hit.
[2024-05-28 18:09:49] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 18:10:04] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 1 ms to minimize.
[2024-05-28 18:10:05] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 2 ms to minimize.
[2024-05-28 18:10:05] [INFO ] Deduced a trap composed of 55 places in 236 ms of which 3 ms to minimize.
[2024-05-28 18:10:06] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1830 variables, and 43 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 18:10:22] [INFO ] Deduced a trap composed of 168 places in 155 ms of which 2 ms to minimize.
[2024-05-28 18:10:22] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
[2024-05-28 18:10:22] [INFO ] Deduced a trap composed of 57 places in 37 ms of which 1 ms to minimize.
[2024-05-28 18:10:22] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
[2024-05-28 18:10:22] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2024-05-28 18:10:24] [INFO ] Deduced a trap composed of 58 places in 34 ms of which 1 ms to minimize.
[2024-05-28 18:10:24] [INFO ] Deduced a trap composed of 57 places in 32 ms of which 1 ms to minimize.
[2024-05-28 18:10:34] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 3 ms to minimize.
[2024-05-28 18:10:34] [INFO ] Deduced a trap composed of 142 places in 260 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1830 variables, and 52 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 13/13 constraints]
After SMT, in 46292ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 46317ms
[2024-05-28 18:10:35] [INFO ] Redundant transitions in 75 ms returned []
Running 1401 sub problems to find dead transitions.
[2024-05-28 18:10:35] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 18:10:35] [INFO ] Invariant cache hit.
[2024-05-28 18:10:35] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 18:10:51] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2024-05-28 18:10:52] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 3 ms to minimize.
[2024-05-28 18:10:52] [INFO ] Deduced a trap composed of 55 places in 198 ms of which 2 ms to minimize.
[2024-05-28 18:10:53] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 1 ms to minimize.
[2024-05-28 18:11:05] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 2 ms to minimize.
[2024-05-28 18:11:05] [INFO ] Deduced a trap composed of 168 places in 195 ms of which 2 ms to minimize.
[2024-05-28 18:11:05] [INFO ] Deduced a trap composed of 156 places in 230 ms of which 2 ms to minimize.
[2024-05-28 18:11:06] [INFO ] Deduced a trap composed of 131 places in 183 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1830 variables, and 47 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 18:11:21] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-05-28 18:11:21] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2024-05-28 18:11:21] [INFO ] Deduced a trap composed of 58 places in 41 ms of which 1 ms to minimize.
[2024-05-28 18:11:21] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2024-05-28 18:11:25] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 18:11:38] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 1 ms to minimize.
[2024-05-28 18:11:41] [INFO ] Deduced a trap composed of 164 places in 273 ms of which 3 ms to minimize.
[2024-05-28 18:11:41] [INFO ] Deduced a trap composed of 164 places in 245 ms of which 3 ms to minimize.
[2024-05-28 18:11:41] [INFO ] Deduced a trap composed of 162 places in 241 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 9)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 timeout
0)
(s43 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1830 variables, and 56 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 17/17 constraints]
After SMT, in 66437ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 66460ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 112917 ms. Remains : 449/449 places, 1405/1405 transitions.
Built C files in :
/tmp/ltsmin6893404939446109349
[2024-05-28 18:11:42] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6893404939446109349
Running compilation step : cd /tmp/ltsmin6893404939446109349;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6893404939446109349;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6893404939446109349;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 38 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 1405/1405 transitions.
Applied a total of 0 rules in 16 ms. Remains 449 /449 variables (removed 0) and now considering 1405/1405 (removed 0) transitions.
Running 1401 sub problems to find dead transitions.
[2024-05-28 18:11:45] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 18:11:45] [INFO ] Invariant cache hit.
[2024-05-28 18:11:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 18:11:59] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-05-28 18:12:00] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 3 ms to minimize.
[2024-05-28 18:12:00] [INFO ] Deduced a trap composed of 55 places in 229 ms of which 3 ms to minimize.
[2024-05-28 18:12:01] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1830 variables, and 43 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 18:12:18] [INFO ] Deduced a trap composed of 168 places in 217 ms of which 3 ms to minimize.
[2024-05-28 18:12:18] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 2 ms to minimize.
[2024-05-28 18:12:18] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 0 ms to minimize.
[2024-05-28 18:12:19] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 2 ms to minimize.
[2024-05-28 18:12:19] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2024-05-28 18:12:21] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
[2024-05-28 18:12:21] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1830 variables, and 50 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 11/11 constraints]
After SMT, in 46226ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 46253ms
[2024-05-28 18:12:31] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 18:12:31] [INFO ] Invariant cache hit.
[2024-05-28 18:12:32] [INFO ] Implicit Places using invariants in 598 ms returned []
[2024-05-28 18:12:32] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 18:12:32] [INFO ] Invariant cache hit.
[2024-05-28 18:12:32] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 18:12:41] [INFO ] Implicit Places using invariants and state equation in 9030 ms returned []
Implicit Place search using SMT with State Equation took 9630 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-05-28 18:12:41] [INFO ] Flow matrix only has 1381 transitions (discarded 24 similar events)
[2024-05-28 18:12:41] [INFO ] Invariant cache hit.
[2024-05-28 18:12:41] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 18:12:56] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 2 ms to minimize.
[2024-05-28 18:12:56] [INFO ] Deduced a trap composed of 26 places in 274 ms of which 2 ms to minimize.
[2024-05-28 18:12:57] [INFO ] Deduced a trap composed of 55 places in 236 ms of which 2 ms to minimize.
[2024-05-28 18:12:58] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 1 ms to minimize.
[2024-05-28 18:13:08] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 2 ms to minimize.
[2024-05-28 18:13:08] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 2 ms to minimize.
[2024-05-28 18:13:09] [INFO ] Deduced a trap composed of 156 places in 276 ms of which 2 ms to minimize.
[2024-05-28 18:13:10] [INFO ] Deduced a trap composed of 131 places in 281 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1830 variables, and 47 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 18:13:23] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
[2024-05-28 18:13:23] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 1 ms to minimize.
[2024-05-28 18:13:24] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 1 ms to minimize.
[2024-05-28 18:13:24] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2024-05-28 18:13:29] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
[2024-05-28 18:13:42] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 1 ms to minimize.
[2024-05-28 18:13:45] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 3 ms to minimize.
[2024-05-28 18:13:45] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 2 ms to minimize.
[2024-05-28 18:13:45] [INFO ] Deduced a trap composed of 162 places in 236 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1830 variables, and 56 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/449 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 17/17 constraints]
After SMT, in 65847ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 65865ms
Finished structural reductions in LTL mode , in 1 iterations and 121774 ms. Remains : 449/449 places, 1405/1405 transitions.
Built C files in :
/tmp/ltsmin10322656123472205267
[2024-05-28 18:13:47] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10322656123472205267
Running compilation step : cd /tmp/ltsmin10322656123472205267;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10322656123472205267;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10322656123472205267;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 18:13:50] [INFO ] Flatten gal took : 81 ms
[2024-05-28 18:13:50] [INFO ] Flatten gal took : 70 ms
[2024-05-28 18:13:50] [INFO ] Time to serialize gal into /tmp/LTL18338281892080206358.gal : 12 ms
[2024-05-28 18:13:50] [INFO ] Time to serialize properties into /tmp/LTL17780322271667140982.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/LTL18338281892080206358.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11756856228923907747.hoa' '-atoms' '/tmp/LTL17780322271667140982.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...320
Loading property file /tmp/LTL17780322271667140982.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11756856228923907747.hoa
Detected timeout of ITS tools.
[2024-05-28 18:14:05] [INFO ] Flatten gal took : 89 ms
[2024-05-28 18:14:05] [INFO ] Flatten gal took : 66 ms
[2024-05-28 18:14:05] [INFO ] Time to serialize gal into /tmp/LTL14270281862344667748.gal : 11 ms
[2024-05-28 18:14:05] [INFO ] Time to serialize properties into /tmp/LTL2925434917630527124.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/LTL14270281862344667748.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2925434917630527124.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((X((F("(((((((NoSigAbort>=1)&&(Abort_Check_Sources_B_3>=1))||((NoSigAbort>=1)&&(Abort_Check_Sources_B_4>=1)))||(((Abort_Check_Sou...1990
Formula 0 simplified : F(X(G!"(((((((NoSigAbort>=1)&&(Abort_Check_Sources_B_3>=1))||((NoSigAbort>=1)&&(Abort_Check_Sources_B_4>=1)))||(((Abort_Check_Source...1979
Detected timeout of ITS tools.
[2024-05-28 18:14:20] [INFO ] Flatten gal took : 47 ms
[2024-05-28 18:14:20] [INFO ] Applying decomposition
[2024-05-28 18:14:20] [INFO ] Flatten gal took : 46 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/graph15496931796698864095.txt' '-o' '/tmp/graph15496931796698864095.bin' '-w' '/tmp/graph15496931796698864095.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15496931796698864095.bin' '-l' '-1' '-v' '-w' '/tmp/graph15496931796698864095.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:14:21] [INFO ] Decomposing Gal with order
[2024-05-28 18:14:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:14:21] [INFO ] Removed a total of 843 redundant transitions.
[2024-05-28 18:14:21] [INFO ] Flatten gal took : 109 ms
[2024-05-28 18:14:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 203 labels/synchronizations in 32 ms.
[2024-05-28 18:14:21] [INFO ] Time to serialize gal into /tmp/LTL6248354149388256007.gal : 9 ms
[2024-05-28 18:14:21] [INFO ] Time to serialize properties into /tmp/LTL7361140534235663361.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/LTL6248354149388256007.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7361140534235663361.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !((G((X((F("(((((((i5.u0.NoSigAbort>=1)&&(i5.u0.Abort_Check_Sources_B_3>=1))||((i5.u0.NoSigAbort>=1)&&(i5.u0.Abort_Check_Sources_B_4>=...2428
Formula 0 simplified : F(X(G!"(((((((i5.u0.NoSigAbort>=1)&&(i5.u0.Abort_Check_Sources_B_3>=1))||((i5.u0.NoSigAbort>=1)&&(i5.u0.Abort_Check_Sources_B_4>=1))...2417
Detected timeout of ITS tools.
Treatment of property PolyORBLF-PT-S04J06T06-LTLFireability-05 finished in 587855 ms.
[2024-05-28 18:14:36] [INFO ] Flatten gal took : 40 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13530788895268128725
[2024-05-28 18:14:36] [INFO ] Too many transitions (1554) to apply POR reductions. Disabling POR matrices.
[2024-05-28 18:14:36] [INFO ] Applying decomposition
[2024-05-28 18:14:36] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13530788895268128725
Running compilation step : cd /tmp/ltsmin13530788895268128725;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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-05-28 18:14:36] [INFO ] Flatten gal took : 42 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/graph13614596305405560645.txt' '-o' '/tmp/graph13614596305405560645.bin' '-w' '/tmp/graph13614596305405560645.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13614596305405560645.bin' '-l' '-1' '-v' '-w' '/tmp/graph13614596305405560645.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:14:36] [INFO ] Decomposing Gal with order
[2024-05-28 18:14:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:14:36] [INFO ] Removed a total of 1200 redundant transitions.
[2024-05-28 18:14:36] [INFO ] Flatten gal took : 184 ms
[2024-05-28 18:14:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 261 labels/synchronizations in 51 ms.
[2024-05-28 18:14:36] [INFO ] Time to serialize gal into /tmp/LTLFireability12975453783422781626.gal : 40 ms
[2024-05-28 18:14:36] [INFO ] Time to serialize properties into /tmp/LTLFireability16790817303869350697.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/LTLFireability12975453783422781626.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16790817303869350697.ltl' '-c' '-stutter-deadlock'

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...278
Read 1 LTL properties
Checking formula 0 : !((G((X((F("(((((((i0.i0.u19.NoSigAbort>=1)&&(i0.i0.u19.Abort_Check_Sources_B_3>=1))||((i0.i0.u19.NoSigAbort>=1)&&(i0.i0.u19.Abort_Che...2660
Formula 0 simplified : F(X(G!"(((((((i0.i0.u19.NoSigAbort>=1)&&(i0.i0.u19.Abort_Check_Sources_B_3>=1))||((i0.i0.u19.NoSigAbort>=1)&&(i0.i0.u19.Abort_Check_...2649
Compilation finished in 4017 ms.
Running link step : cd /tmp/ltsmin13530788895268128725;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin13530788895268128725;'/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' '[]((X((<>((LTLAPp0==true)) U X((LTLAPp1==true))))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.014: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.348: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.348: LTL layer: formula: []((X((<>((LTLAPp0==true)) U X((LTLAPp1==true))))&&<>((LTLAPp2==true))))
pins2lts-mc-linux64( 1/ 8), 0.348: "[]((X((<>((LTLAPp0==true)) U X((LTLAPp1==true))))&&<>((LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.348: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.353: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.369: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.358: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.362: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.363: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.365: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.370: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.426: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.890: DFS-FIFO for weak LTL, using special progress label 1558
pins2lts-mc-linux64( 0/ 8), 0.890: There are 1559 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.890: State length is 599, there are 1564 groups
pins2lts-mc-linux64( 0/ 8), 0.890: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.890: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.890: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.890: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.977: ~22 levels ~960 states ~1928 transitions
pins2lts-mc-linux64( 3/ 8), 1.112: ~22 levels ~1920 states ~3376 transitions
pins2lts-mc-linux64( 3/ 8), 1.547: ~22 levels ~3840 states ~6472 transitions
pins2lts-mc-linux64( 3/ 8), 1.942: ~22 levels ~7680 states ~13744 transitions
pins2lts-mc-linux64( 3/ 8), 2.693: ~22 levels ~15360 states ~27272 transitions
pins2lts-mc-linux64( 7/ 8), 3.374: ~18 levels ~30720 states ~50224 transitions
pins2lts-mc-linux64( 7/ 8), 4.549: ~18 levels ~61440 states ~107272 transitions
pins2lts-mc-linux64( 7/ 8), 6.851: ~22 levels ~122880 states ~225096 transitions
pins2lts-mc-linux64( 7/ 8), 11.534: ~22 levels ~245760 states ~463392 transitions
pins2lts-mc-linux64( 4/ 8), 20.198: ~26 levels ~491520 states ~991264 transitions
pins2lts-mc-linux64( 7/ 8), 36.880: ~22 levels ~983040 states ~2004864 transitions
pins2lts-mc-linux64( 7/ 8), 70.444: ~22 levels ~1966080 states ~4151808 transitions
pins2lts-mc-linux64( 7/ 8), 138.179: ~26 levels ~3932160 states ~8664664 transitions
pins2lts-mc-linux64( 6/ 8), 274.586: ~83 levels ~7864320 states ~18134240 transitions
pins2lts-mc-linux64( 0/ 8), 543.951: ~83 levels ~15728640 states ~35838496 transitions
pins2lts-mc-linux64( 0/ 8), 1086.081: ~83 levels ~31457280 states ~74614728 transitions
pins2lts-mc-linux64( 5/ 8), 1299.209: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1299.257:
pins2lts-mc-linux64( 0/ 8), 1299.257: mean standard work distribution: 1.4% (states) 1.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 1299.257:
pins2lts-mc-linux64( 0/ 8), 1299.257: Explored 37228025 states 88879605 transitions, fanout: 2.387
pins2lts-mc-linux64( 0/ 8), 1299.257: Total exploration time 1298.360 sec (1298.320 sec minimum, 1298.340 sec on average)
pins2lts-mc-linux64( 0/ 8), 1299.257: States per second: 28673, Transitions per second: 68455
pins2lts-mc-linux64( 0/ 8), 1299.257:
pins2lts-mc-linux64( 0/ 8), 1299.257: Progress states detected: 7
pins2lts-mc-linux64( 0/ 8), 1299.257: Redundant explorations: 0.0207
pins2lts-mc-linux64( 0/ 8), 1299.257:
pins2lts-mc-linux64( 0/ 8), 1299.257: Queue width: 8B, total height: 672, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 1299.257: Tree memory: 540.0MB, 15.2 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 1299.257: Tree fill ratio (roots/leafs): 27.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1299.257: Stored 1634 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1299.257: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1299.257: Est. total memory use: 540.0MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13530788895268128725;'/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' '[]((X((<>((LTLAPp0==true)) U X((LTLAPp1==true))))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13530788895268128725;'/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' '[]((X((<>((LTLAPp0==true)) U X((LTLAPp1==true))))&&<>((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)
Detected timeout of ITS tools.
[2024-05-28 18:44:07] [INFO ] Flatten gal took : 45 ms
[2024-05-28 18:44:07] [INFO ] Time to serialize gal into /tmp/LTLFireability3144185543774697393.gal : 9 ms
[2024-05-28 18:44:07] [INFO ] Time to serialize properties into /tmp/LTLFireability15618902110034866939.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/LTLFireability3144185543774697393.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15618902110034866939.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 1 LTL properties
Checking formula 0 : !((G((X((F("(((((((NoSigAbort>=1)&&(Abort_Check_Sources_B_3>=1))||((NoSigAbort>=1)&&(Abort_Check_Sources_B_4>=1)))||(((Abort_Check_Sou...1990
Formula 0 simplified : F(X(G!"(((((((NoSigAbort>=1)&&(Abort_Check_Sources_B_3>=1))||((NoSigAbort>=1)&&(Abort_Check_Sources_B_4>=1)))||(((Abort_Check_Source...1979

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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="PolyORBLF-PT-S04J06T06"
export BK_EXAMINATION="LTLFireability"
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 PolyORBLF-PT-S04J06T06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654446800292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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