fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r136-tall-171631133100636
Last Updated
July 7, 2024

About the Execution of ITS-Tools for DoubleLock-PT-p3s2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13845.768 3600000.00 3961503.00 8875.80 FFTTTTF?FFTFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 330K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716416395250

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p3s2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 22:19:56] [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-22 22:19:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:19:56] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-05-22 22:19:56] [INFO ] Transformed 112 places.
[2024-05-22 22:19:56] [INFO ] Transformed 744 transitions.
[2024-05-22 22:19:56] [INFO ] Parsed PT model containing 112 places and 744 transitions and 3008 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 32 transitions.
FORMULA DoubleLock-PT-p3s2-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 712/712 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 89 transition count 712
Applied a total of 3 rules in 24 ms. Remains 89 /92 variables (removed 3) and now considering 712/712 (removed 0) transitions.
[2024-05-22 22:19:56] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
// Phase 1: matrix 515 rows 89 cols
[2024-05-22 22:19:57] [INFO ] Computed 2 invariants in 24 ms
[2024-05-22 22:19:57] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-22 22:19:57] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2024-05-22 22:19:57] [INFO ] Invariant cache hit.
[2024-05-22 22:19:57] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-22 22:19:57] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2024-05-22 22:19:57] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2024-05-22 22:19:57] [INFO ] Invariant cache hit.
[2024-05-22 22:19:57] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 0 solved, 710 unsolved in 20807 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 710/848 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 0/848 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 7 (OVERLAPS) 0/604 variables, 0/848 constraints. Problems are: Problem set: 144 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 604/604 variables, and 848 constraints, problems are : Problem set: 144 solved, 566 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints]
After SMT, in 51607ms problems are : Problem set: 144 solved, 566 unsolved
Search for dead transitions found 144 dead transitions in 51640ms
Found 144 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in LTL mode, iteration 1 : 89/92 places, 568/712 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 84 transition count 568
Applied a total of 5 rules in 6 ms. Remains 84 /89 variables (removed 5) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:20:49] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 84 cols
[2024-05-22 22:20:49] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 22:20:49] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 22:20:49] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:20:49] [INFO ] Invariant cache hit.
[2024-05-22 22:20:49] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:20:49] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 84/92 places, 568/712 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52492 ms. Remains : 84/92 places, 568/712 transitions.
Support contains 30 out of 84 places after structural reductions.
[2024-05-22 22:20:49] [INFO ] Flatten gal took : 63 ms
[2024-05-22 22:20:49] [INFO ] Flatten gal took : 34 ms
[2024-05-22 22:20:49] [INFO ] Input system was already deterministic with 568 transitions.
RANDOM walk for 40008 steps (463 resets) in 1424 ms. (28 steps per ms) remains 8/21 properties
BEST_FIRST walk for 40004 steps (100 resets) in 191 ms. (208 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (104 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (103 resets) in 88 ms. (449 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40002 steps (80 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
[2024-05-22 22:20:50] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:20:50] [INFO ] Invariant cache hit.
[2024-05-22 22:20:50] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 93/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 349/450 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 41/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 23/473 variables, 23/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/473 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 126 constraints, problems are : Problem set: 0 solved, 4 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 93/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 349/450 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 41/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp11 is UNSAT
At refinement iteration 8 (OVERLAPS) 23/473 variables, 23/130 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 0/130 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/473 variables, 0/130 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 473/473 variables, and 130 constraints, problems are : Problem set: 3 solved, 1 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 474ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 568/568 transitions.
Graph (complete) has 931 edges and 84 vertex of which 81 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 81 transition count 560
Applied a total of 9 rules in 47 ms. Remains 81 /84 variables (removed 3) and now considering 560/568 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 81/84 places, 560/568 transitions.
RANDOM walk for 40014 steps (468 resets) in 862 ms. (46 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (83 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 10144 steps, run visited all 1 properties in 67 ms. (steps per millisecond=151 )
Probabilistic random walk after 10144 steps, saw 6977 distinct states, run finished after 78 ms. (steps per millisecond=130 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DoubleLock-PT-p3s2-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 176 stable transitions
Graph (complete) has 1053 edges and 84 vertex of which 81 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Graph (complete) has 1053 edges and 84 vertex of which 81 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 20 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:20:51] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 81 cols
[2024-05-22 22:20:51] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 22:20:51] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-22 22:20:51] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:20:51] [INFO ] Invariant cache hit.
[2024-05-22 22:20:51] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:20:51] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-05-22 22:20:51] [INFO ] Redundant transitions in 29 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 22:20:51] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:20:51] [INFO ] Invariant cache hit.
[2024-05-22 22:20:51] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 12654 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43181ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43186ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43498 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-00
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 4 ms.
FORMULA DoubleLock-PT-p3s2-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLFireability-00 finished in 43748 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((G(!p0) U (!p1&&X(G(!p2)))))))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 81 transition count 568
Applied a total of 3 rules in 9 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:21:35] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:21:35] [INFO ] Invariant cache hit.
[2024-05-22 22:21:35] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-22 22:21:35] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:21:35] [INFO ] Invariant cache hit.
[2024-05-22 22:21:35] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:21:35] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 566 sub problems to find dead transitions.
[2024-05-22 22:21:35] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:21:35] [INFO ] Invariant cache hit.
[2024-05-22 22:21:35] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 12816 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43275ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43288ms
Starting structural reductions in LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43584 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 288 ms :[(OR p1 p2), (OR p1 p2), true, p0, p2, (OR p2 p1), p2]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-06
Product exploration explored 100000 steps with 1855 reset in 330 ms.
Product exploration explored 100000 steps with 1876 reset in 288 ms.
Computed a total of 7 stabilizing places and 176 stable transitions
Computed a total of 7 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 109 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter sensitive) to 7 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(OR p1 p2), (OR p1 p2), true, p0, p2, (OR p2 p1), p2]
Reduction of identical properties reduced properties to check from 14 to 11
RANDOM walk for 40000 steps (466 resets) in 380 ms. (104 steps per ms) remains 7/11 properties
BEST_FIRST walk for 40004 steps (96 resets) in 338 ms. (118 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (107 resets) in 352 ms. (113 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (95 resets) in 329 ms. (121 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (104 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
[2024-05-22 22:22:20] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:22:20] [INFO ] Invariant cache hit.
[2024-05-22 22:22:20] [INFO ] State equation strengthened by 41 read => feed constraints.
Problem apf1 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 149/162 variables, 13/14 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 2/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem apf6 is UNSAT
Problem apf7 is UNSAT
After SMT solving in domain Real declared 467/470 variables, and 81 constraints, problems are : Problem set: 4 solved, 0 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 78/81 constraints, ReadFeed: 2/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 96ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (G (OR (NOT p0) (NOT p2))), (G (OR (NOT p0) p1)), (G (OR p0 (NOT p1) (NOT p2))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F p2), (F (NOT (OR p0 p1 (NOT p2)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p0) p2)))
Knowledge based reduction with 26 factoid took 146 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DoubleLock-PT-p3s2-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DoubleLock-PT-p3s2-LTLFireability-06 finished in 45602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Graph (complete) has 1053 edges and 84 vertex of which 81 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:22:20] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:22:20] [INFO ] Invariant cache hit.
[2024-05-22 22:22:20] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 22:22:20] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:22:20] [INFO ] Invariant cache hit.
[2024-05-22 22:22:21] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:22:21] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2024-05-22 22:22:21] [INFO ] Redundant transitions in 13 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 22:22:21] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:22:21] [INFO ] Invariant cache hit.
[2024-05-22 22:22:21] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 12599 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43085ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43092ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43374 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-07
Product exploration explored 100000 steps with 1850 reset in 229 ms.
Product exploration explored 100000 steps with 1864 reset in 220 ms.
Computed a total of 7 stabilizing places and 176 stable transitions
Computed a total of 7 stabilizing places and 176 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 30747 steps (356 resets) in 56 ms. (539 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 568/568 transitions.
Applied a total of 0 rules in 20 ms. Remains 81 /81 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:23:05] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:23:05] [INFO ] Invariant cache hit.
[2024-05-22 22:23:05] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-22 22:23:05] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:23:05] [INFO ] Invariant cache hit.
[2024-05-22 22:23:05] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:23:05] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2024-05-22 22:23:05] [INFO ] Redundant transitions in 4 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 22:23:05] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:23:05] [INFO ] Invariant cache hit.
[2024-05-22 22:23:05] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 12821 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 29583 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 42819ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 42824ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43124 ms. Remains : 81/81 places, 568/568 transitions.
Computed a total of 7 stabilizing places and 176 stable transitions
Computed a total of 7 stabilizing places and 176 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 36281 steps (427 resets) in 62 ms. (575 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1885 reset in 192 ms.
Product exploration explored 100000 steps with 1886 reset in 237 ms.
Built C files in :
/tmp/ltsmin5244352082368035086
[2024-05-22 22:23:49] [INFO ] Computing symmetric may disable matrix : 568 transitions.
[2024-05-22 22:23:49] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 22:23:49] [INFO ] Computing symmetric may enable matrix : 568 transitions.
[2024-05-22 22:23:49] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 22:23:49] [INFO ] Computing Do-Not-Accords matrix : 568 transitions.
[2024-05-22 22:23:49] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 22:23:49] [INFO ] Built C files in 127ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5244352082368035086
Running compilation step : cd /tmp/ltsmin5244352082368035086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1668 ms.
Running link step : cd /tmp/ltsmin5244352082368035086;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin5244352082368035086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8735631704727805162.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 568/568 transitions.
Applied a total of 0 rules in 15 ms. Remains 81 /81 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:24:04] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:24:04] [INFO ] Invariant cache hit.
[2024-05-22 22:24:04] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-22 22:24:04] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:24:04] [INFO ] Invariant cache hit.
[2024-05-22 22:24:04] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:24:04] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2024-05-22 22:24:04] [INFO ] Redundant transitions in 4 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 22:24:04] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:24:04] [INFO ] Invariant cache hit.
[2024-05-22 22:24:04] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 12937 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43377ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43385ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43673 ms. Remains : 81/81 places, 568/568 transitions.
Built C files in :
/tmp/ltsmin7388401012815495361
[2024-05-22 22:24:48] [INFO ] Computing symmetric may disable matrix : 568 transitions.
[2024-05-22 22:24:48] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 22:24:48] [INFO ] Computing symmetric may enable matrix : 568 transitions.
[2024-05-22 22:24:48] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 22:24:48] [INFO ] Computing Do-Not-Accords matrix : 568 transitions.
[2024-05-22 22:24:48] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 22:24:48] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7388401012815495361
Running compilation step : cd /tmp/ltsmin7388401012815495361;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1516 ms.
Running link step : cd /tmp/ltsmin7388401012815495361;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin7388401012815495361;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17695537549754161300.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 22:25:03] [INFO ] Flatten gal took : 30 ms
[2024-05-22 22:25:03] [INFO ] Flatten gal took : 28 ms
[2024-05-22 22:25:03] [INFO ] Time to serialize gal into /tmp/LTL10858059205937731302.gal : 5 ms
[2024-05-22 22:25:03] [INFO ] Time to serialize properties into /tmp/LTL3344385589500385235.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/LTL10858059205937731302.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8062881983692407137.hoa' '-atoms' '/tmp/LTL3344385589500385235.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3344385589500385235.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8062881983692407137.hoa
Detected timeout of ITS tools.
[2024-05-22 22:25:18] [INFO ] Flatten gal took : 23 ms
[2024-05-22 22:25:18] [INFO ] Flatten gal took : 22 ms
[2024-05-22 22:25:18] [INFO ] Time to serialize gal into /tmp/LTL976665301000062375.gal : 5 ms
[2024-05-22 22:25:18] [INFO ] Time to serialize properties into /tmp/LTL17409136737493805441.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/LTL976665301000062375.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17409136737493805441.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l26<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l26<1))"
Detected timeout of ITS tools.
[2024-05-22 22:25:33] [INFO ] Flatten gal took : 22 ms
[2024-05-22 22:25:33] [INFO ] Applying decomposition
[2024-05-22 22:25:33] [INFO ] Flatten gal took : 19 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/graph3002240843548851836.txt' '-o' '/tmp/graph3002240843548851836.bin' '-w' '/tmp/graph3002240843548851836.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3002240843548851836.bin' '-l' '-1' '-v' '-w' '/tmp/graph3002240843548851836.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:25:33] [INFO ] Decomposing Gal with order
[2024-05-22 22:25:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:25:33] [INFO ] Removed a total of 1220 redundant transitions.
[2024-05-22 22:25:33] [INFO ] Flatten gal took : 76 ms
[2024-05-22 22:25:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 19 ms.
[2024-05-22 22:25:33] [INFO ] Time to serialize gal into /tmp/LTL5432119303670713161.gal : 5 ms
[2024-05-22 22:25:33] [INFO ] Time to serialize properties into /tmp/LTL12684311080332601740.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/LTL5432119303670713161.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12684311080332601740.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...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i3.u9.s1<1)||(i1.u18.l26<1))"))))
Formula 0 simplified : FG!"((i3.u9.s1<1)||(i1.u18.l26<1))"
Detected timeout of ITS tools.
Treatment of property DoubleLock-PT-p3s2-LTLFireability-07 finished in 207944 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 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Graph (complete) has 1053 edges and 84 vertex of which 81 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:25:48] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:25:48] [INFO ] Invariant cache hit.
[2024-05-22 22:25:48] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-22 22:25:48] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:25:48] [INFO ] Invariant cache hit.
[2024-05-22 22:25:49] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:25:49] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-05-22 22:25:49] [INFO ] Redundant transitions in 6 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 22:25:49] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:25:49] [INFO ] Invariant cache hit.
[2024-05-22 22:25:49] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 12887 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 29825 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43133ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43140ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43470 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-08
Stuttering criterion allowed to conclude after 55 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p3s2-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLFireability-08 finished in 43550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&X(X(X(p1)))))||X(X(!p0))))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 81 transition count 568
Applied a total of 3 rules in 6 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:26:32] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:26:32] [INFO ] Invariant cache hit.
[2024-05-22 22:26:32] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-22 22:26:32] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:26:32] [INFO ] Invariant cache hit.
[2024-05-22 22:26:32] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:26:32] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 566 sub problems to find dead transitions.
[2024-05-22 22:26:32] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:26:32] [INFO ] Invariant cache hit.
[2024-05-22 22:26:32] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 12526 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 42971ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 42980ms
Starting structural reductions in LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43277 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 217 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 160 ms.
Product exploration explored 100000 steps with 33333 reset in 117 ms.
Computed a total of 7 stabilizing places and 176 stable transitions
Computed a total of 7 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleLock-PT-p3s2-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleLock-PT-p3s2-LTLFireability-10 finished in 43817 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(p0))'
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Graph (complete) has 1053 edges and 84 vertex of which 82 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 82 /84 variables (removed 2) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:27:16] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 82 cols
[2024-05-22 22:27:16] [INFO ] Computed 1 invariants in 4 ms
[2024-05-22 22:27:16] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-22 22:27:16] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:27:16] [INFO ] Invariant cache hit.
[2024-05-22 22:27:16] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:27:16] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-05-22 22:27:16] [INFO ] Redundant transitions in 5 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 22:27:16] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:27:16] [INFO ] Invariant cache hit.
[2024-05-22 22:27:16] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 1/471 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 566 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 7 (OVERLAPS) 0/471 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 124 constraints, problems are : Problem set: 0 solved, 566 unsolved in 16287 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 421/544 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 1/471 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 145/690 constraints. Problems are: Problem set: 0 solved, 566 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/471 variables, and 690 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 46762ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 46770ms
Starting structural reductions in SI_LTL mode, iteration 1 : 82/84 places, 568/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47075 ms. Remains : 82/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-12
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p3s2-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLFireability-12 finished in 47125 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(X(X(G(p0))))&&F(p1)))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 81 transition count 568
Applied a total of 3 rules in 2 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:28:03] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 81 cols
[2024-05-22 22:28:03] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 22:28:03] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 22:28:03] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:28:03] [INFO ] Invariant cache hit.
[2024-05-22 22:28:03] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:28:03] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 566 sub problems to find dead transitions.
[2024-05-22 22:28:03] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:28:03] [INFO ] Invariant cache hit.
[2024-05-22 22:28:03] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 12539 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 42988ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 42994ms
Starting structural reductions in LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43257 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-13
Entered a terminal (fully accepting) state of product in 8872 steps with 163 reset in 25 ms.
FORMULA DoubleLock-PT-p3s2-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLFireability-13 finished in 43542 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(X((F(p0)||X(X(G(p1)))))))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 81 transition count 568
Applied a total of 3 rules in 4 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:28:46] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:28:46] [INFO ] Invariant cache hit.
[2024-05-22 22:28:46] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-22 22:28:46] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:28:46] [INFO ] Invariant cache hit.
[2024-05-22 22:28:46] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:28:47] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 566 sub problems to find dead transitions.
[2024-05-22 22:28:47] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:28:47] [INFO ] Invariant cache hit.
[2024-05-22 22:28:47] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 12621 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 29897 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 42934ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 42941ms
Starting structural reductions in LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43204 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-14
Stuttering criterion allowed to conclude after 631 steps with 9 reset in 5 ms.
FORMULA DoubleLock-PT-p3s2-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLFireability-14 finished in 43438 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(X(X(X(G(p0))))))'
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 81 transition count 568
Applied a total of 3 rules in 4 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 22:29:30] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:29:30] [INFO ] Invariant cache hit.
[2024-05-22 22:29:30] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-22 22:29:30] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:29:30] [INFO ] Invariant cache hit.
[2024-05-22 22:29:30] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 22:29:30] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 566 sub problems to find dead transitions.
[2024-05-22 22:29:30] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 22:29:30] [INFO ] Invariant cache hit.
[2024-05-22 22:29:30] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 12674 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43151ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43159ms
Starting structural reductions in LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43432 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-15
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p3s2-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLFireability-15 finished in 43632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-22 22:30:14] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18228693430286117787
[2024-05-22 22:30:14] [INFO ] Computing symmetric may disable matrix : 568 transitions.
[2024-05-22 22:30:14] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 22:30:14] [INFO ] Computing symmetric may enable matrix : 568 transitions.
[2024-05-22 22:30:14] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 22:30:14] [INFO ] Applying decomposition
[2024-05-22 22:30:14] [INFO ] Flatten gal took : 34 ms
[2024-05-22 22:30:14] [INFO ] Computing Do-Not-Accords matrix : 568 transitions.
[2024-05-22 22:30:14] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17954696336773713383.txt' '-o' '/tmp/graph17954696336773713383.bin' '-w' '/tmp/graph17954696336773713383.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17954696336773713383.bin' '-l' '-1' '-v' '-w' '/tmp/graph17954696336773713383.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:30:14] [INFO ] Decomposing Gal with order
[2024-05-22 22:30:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:30:14] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18228693430286117787
Running compilation step : cd /tmp/ltsmin18228693430286117787;'/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-22 22:30:14] [INFO ] Removed a total of 1225 redundant transitions.
[2024-05-22 22:30:14] [INFO ] Flatten gal took : 69 ms
[2024-05-22 22:30:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 13 ms.
[2024-05-22 22:30:14] [INFO ] Time to serialize gal into /tmp/LTLFireability14067782487709957965.gal : 3 ms
[2024-05-22 22:30:14] [INFO ] Time to serialize properties into /tmp/LTLFireability9385036318015028277.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/LTLFireability14067782487709957965.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9385036318015028277.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...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((i7.u9.s1<1)||(u20.l26<1))"))))
Formula 0 simplified : FG!"((i7.u9.s1<1)||(u20.l26<1))"
Compilation finished in 1536 ms.
Running link step : cd /tmp/ltsmin18228693430286117787;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin18228693430286117787;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.030: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.092: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.164: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.170: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.240: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.302: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.302: Initializing POR dependencies: labels 569, guards 568
pins2lts-mc-linux64( 3/ 8), 0.733: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.739: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 1.426: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 1/ 8), 1.427: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 1.427: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 2.005: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 2.010: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 2.026: There are 571 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 2.026: State length is 85, there are 571 groups
pins2lts-mc-linux64( 0/ 8), 2.026: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 2.026: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 2.026: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 2.026: Visible groups: 0 / 571, labels: 1 / 571
pins2lts-mc-linux64( 0/ 8), 2.026: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 2.026: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 7/ 8), 2.093: [Blue] ~120 levels ~960 states ~4088 transitions
pins2lts-mc-linux64( 7/ 8), 2.144: [Blue] ~240 levels ~1920 states ~7448 transitions
pins2lts-mc-linux64( 7/ 8), 2.223: [Blue] ~480 levels ~3840 states ~14168 transitions
pins2lts-mc-linux64( 3/ 8), 2.362: [Blue] ~866 levels ~7680 states ~23192 transitions
pins2lts-mc-linux64( 3/ 8), 2.598: [Blue] ~1748 levels ~15360 states ~44288 transitions
pins2lts-mc-linux64( 3/ 8), 2.975: [Blue] ~3513 levels ~30720 states ~87048 transitions
pins2lts-mc-linux64( 3/ 8), 3.661: [Blue] ~7043 levels ~61440 states ~172232 transitions
pins2lts-mc-linux64( 6/ 8), 5.311: [Blue] ~12308 levels ~122880 states ~394368 transitions
pins2lts-mc-linux64( 3/ 8), 7.151: [Blue] ~28226 levels ~245760 states ~683672 transitions
pins2lts-mc-linux64( 3/ 8), 10.233: [Blue] ~56468 levels ~491520 states ~1365248 transitions
pins2lts-mc-linux64( 3/ 8), 15.945: [Blue] ~112953 levels ~983040 states ~2728968 transitions
pins2lts-mc-linux64( 3/ 8), 27.491: [Blue] ~225923 levels ~1966080 states ~5456072 transitions
pins2lts-mc-linux64( 3/ 8), 50.830: [Blue] ~451864 levels ~3932160 states ~10910400 transitions
pins2lts-mc-linux64( 4/ 8), 61.210: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 61.393:
pins2lts-mc-linux64( 0/ 8), 61.393: Explored 4066545 states 13171506 transitions, fanout: 3.239
pins2lts-mc-linux64( 0/ 8), 61.393: Total exploration time 59.320 sec (59.150 sec minimum, 59.230 sec on average)
pins2lts-mc-linux64( 0/ 8), 61.393: States per second: 68553, Transitions per second: 222042
pins2lts-mc-linux64( 0/ 8), 61.393:
pins2lts-mc-linux64( 0/ 8), 61.393: State space has 12137437 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 61.393: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 61.393: blue states: 4066545 (33.50%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 61.393: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 61.393: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 61.393:
pins2lts-mc-linux64( 0/ 8), 61.394: Total memory used for local state coloring: 49.6MB
pins2lts-mc-linux64( 0/ 8), 61.394:
pins2lts-mc-linux64( 0/ 8), 61.394: Queue width: 8B, total height: 3253496, memory: 24.82MB
pins2lts-mc-linux64( 0/ 8), 61.394: Tree memory: 348.6MB, 30.1 B/state, compr.: 8.8%
pins2lts-mc-linux64( 0/ 8), 61.394: Tree fill ratio (roots/leafs): 9.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 61.394: Stored 575 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 61.394: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 61.394: Est. total memory use: 373.4MB (~1048.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18228693430286117787;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18228693430286117787;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
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-22 22:53:39] [INFO ] Flatten gal took : 17 ms
[2024-05-22 22:53:39] [INFO ] Time to serialize gal into /tmp/LTLFireability13305915461273409628.gal : 3 ms
[2024-05-22 22:53:39] [INFO ] Time to serialize properties into /tmp/LTLFireability5654226068578537429.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/LTLFireability13305915461273409628.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5654226068578537429.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(F("((s1<1)||(l26<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l26<1))"
Detected timeout of ITS tools.
[2024-05-22 23:17:05] [INFO ] Flatten gal took : 15 ms
[2024-05-22 23:17:05] [INFO ] Input system was already deterministic with 568 transitions.
[2024-05-22 23:17:05] [INFO ] Transformed 84 places.
[2024-05-22 23:17:05] [INFO ] Transformed 568 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 23:17:05] [INFO ] Time to serialize gal into /tmp/LTLFireability2602174003000916749.gal : 3 ms
[2024-05-22 23:17:05] [INFO ] Time to serialize properties into /tmp/LTLFireability2561935861271970668.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/LTLFireability2602174003000916749.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2561935861271970668.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((s1<1)||(l26<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l26<1))"

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="DoubleLock-PT-p3s2"
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 DoubleLock-PT-p3s2, 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 r136-tall-171631133100636"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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