About the Execution of ITS-Tools for ShieldPPPs-PT-010A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15480.939 | 3600000.00 | 9806980.00 | 3785.30 | F??FTTFTFFFT?FFF | 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.r356-tall-171683761100435.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 ShieldPPPs-PT-010A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761100435
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.9K 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 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 19 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 11:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 13 11:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 11:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 13 11:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 88K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-010A-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716965687203
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-010A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-29 06:54:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 06:54:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 06:54:48] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-29 06:54:48] [INFO ] Transformed 313 places.
[2024-05-29 06:54:48] [INFO ] Transformed 263 transitions.
[2024-05-29 06:54:48] [INFO ] Found NUPN structural information;
[2024-05-29 06:54:48] [INFO ] Parsed PT model containing 313 places and 263 transitions and 1006 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPs-PT-010A-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 36 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-05-29 06:54:48] [INFO ] Computed 111 invariants in 18 ms
[2024-05-29 06:54:49] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-29 06:54:49] [INFO ] Invariant cache hit.
[2024-05-29 06:54:49] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 06:54:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:54:55] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:54:59] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
[2024-05-29 06:54:59] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-29 06:54:59] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
[2024-05-29 06:54:59] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 06:54:59] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:54:59] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 06:55:01] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 17989 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:55:15] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30020 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 48097ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 48111ms
Finished structural reductions in LTL mode , in 1 iterations and 48857 ms. Remains : 313/313 places, 263/263 transitions.
Support contains 22 out of 313 places after structural reductions.
[2024-05-29 06:55:37] [INFO ] Flatten gal took : 49 ms
[2024-05-29 06:55:37] [INFO ] Flatten gal took : 22 ms
[2024-05-29 06:55:37] [INFO ] Input system was already deterministic with 263 transitions.
RANDOM walk for 2479 steps (1 resets) in 214 ms. (11 steps per ms) remains 0/12 properties
FORMULA ShieldPPPs-PT-010A-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 9 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-05-29 06:55:38] [INFO ] Invariant cache hit.
[2024-05-29 06:55:38] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-29 06:55:38] [INFO ] Invariant cache hit.
[2024-05-29 06:55:38] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 06:55:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:55:43] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:55:47] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:55:47] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-29 06:55:48] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:55:48] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:55:48] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 06:55:48] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:55:49] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 17602 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:56:04] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30015 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 47660ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 47666ms
Finished structural reductions in LTL mode , in 1 iterations and 48075 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-01
Product exploration explored 100000 steps with 687 reset in 502 ms.
Product exploration explored 100000 steps with 680 reset in 418 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 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 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 48 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-05-29 06:56:27] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 06:56:27] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-29 06:56:27] [INFO ] Invariant cache hit.
[2024-05-29 06:56:28] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2024-05-29 06:56:28] [INFO ] Redundant transitions in 10 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 06:56:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:56:35] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:56:39] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 06:56:40] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18828 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:57:12] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-29 06:57:13] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30017 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48880ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48886ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49374 ms. Remains : 311/313 places, 261/263 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 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 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 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 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 698 reset in 336 ms.
Product exploration explored 100000 steps with 707 reset in 409 ms.
Built C files in :
/tmp/ltsmin7099628768068884110
[2024-05-29 06:57:18] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 06:57:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:57:18] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 06:57:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:57:18] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 06:57:18] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:57:18] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7099628768068884110
Running compilation step : cd /tmp/ltsmin7099628768068884110;'/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 686 ms.
Running link step : cd /tmp/ltsmin7099628768068884110;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin7099628768068884110;'/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/stateBased11420617039085210610.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 17 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 06:57:33] [INFO ] Invariant cache hit.
[2024-05-29 06:57:33] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-29 06:57:33] [INFO ] Invariant cache hit.
[2024-05-29 06:57:34] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2024-05-29 06:57:34] [INFO ] Redundant transitions in 3 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 06:57:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:57:40] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:57:45] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 06:57:46] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18395 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 06:58:17] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:58:19] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30017 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48443ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48445ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48912 ms. Remains : 311/311 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin4418193795019422543
[2024-05-29 06:58:22] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 06:58:22] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:58:22] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 06:58:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:58:22] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 06:58:22] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:58:22] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4418193795019422543
Running compilation step : cd /tmp/ltsmin4418193795019422543;'/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 609 ms.
Running link step : cd /tmp/ltsmin4418193795019422543;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4418193795019422543;'/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/stateBased14793663519398576586.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 06:58:37] [INFO ] Flatten gal took : 19 ms
[2024-05-29 06:58:37] [INFO ] Flatten gal took : 17 ms
[2024-05-29 06:58:37] [INFO ] Time to serialize gal into /tmp/LTL5727417708363057375.gal : 6 ms
[2024-05-29 06:58:37] [INFO ] Time to serialize properties into /tmp/LTL6535045554498126399.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/LTL5727417708363057375.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4268991150567044563.hoa' '-atoms' '/tmp/LTL6535045554498126399.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6535045554498126399.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4268991150567044563.hoa
Detected timeout of ITS tools.
[2024-05-29 06:58:52] [INFO ] Flatten gal took : 17 ms
[2024-05-29 06:58:52] [INFO ] Flatten gal took : 16 ms
[2024-05-29 06:58:52] [INFO ] Time to serialize gal into /tmp/LTL2879923354928933105.gal : 3 ms
[2024-05-29 06:58:52] [INFO ] Time to serialize properties into /tmp/LTL16913257260130633927.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2879923354928933105.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16913257260130633927.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F("((p160==0)||(p138==1))"))))
Formula 0 simplified : XG!"((p160==0)||(p138==1))"
Detected timeout of ITS tools.
[2024-05-29 06:59:07] [INFO ] Flatten gal took : 16 ms
[2024-05-29 06:59:07] [INFO ] Applying decomposition
[2024-05-29 06:59:07] [INFO ] Flatten gal took : 16 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/graph8146897519063320204.txt' '-o' '/tmp/graph8146897519063320204.bin' '-w' '/tmp/graph8146897519063320204.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8146897519063320204.bin' '-l' '-1' '-v' '-w' '/tmp/graph8146897519063320204.weights' '-q' '0' '-e' '0.001'
[2024-05-29 06:59:07] [INFO ] Decomposing Gal with order
[2024-05-29 06:59:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 06:59:08] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 06:59:08] [INFO ] Flatten gal took : 62 ms
[2024-05-29 06:59:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 12 ms.
[2024-05-29 06:59:08] [INFO ] Time to serialize gal into /tmp/LTL10338476611153806210.gal : 7 ms
[2024-05-29 06:59:08] [INFO ] Time to serialize properties into /tmp/LTL9529701893039311264.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/LTL10338476611153806210.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9529701893039311264.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 : !((X(F("((i5.i0.u57.p160==0)||(i4.i3.u49.p138==1))"))))
Formula 0 simplified : XG!"((i5.i0.u57.p160==0)||(i4.i3.u49.p138==1))"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-01 finished in 225113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0))||(F(!p0)&&G((F(p1)&&F(p0)))))))'
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 8 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-05-29 06:59:23] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 06:59:23] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-29 06:59:23] [INFO ] Invariant cache hit.
[2024-05-29 06:59:23] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 06:59:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:59:28] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:59:32] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-29 06:59:32] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-29 06:59:33] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:59:33] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
[2024-05-29 06:59:33] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 4 ms to minimize.
[2024-05-29 06:59:33] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:59:34] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 17458 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 06:59:49] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30017 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 47506ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 47509ms
Finished structural reductions in LTL mode , in 1 iterations and 47935 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 216 ms :[p0, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-02
Product exploration explored 100000 steps with 3029 reset in 302 ms.
Product exploration explored 100000 steps with 3015 reset in 338 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 83 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 1546 steps (0 resets) in 25 ms. (59 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2024-05-29 07:00:12] [INFO ] Invariant cache hit.
[2024-05-29 07:00:12] [INFO ] [Real]Absence check using 111 positive place invariants in 36 ms returned sat
[2024-05-29 07:00:12] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2024-05-29 07:00:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:00:13] [INFO ] [Nat]Absence check using 111 positive place invariants in 28 ms returned sat
[2024-05-29 07:00:13] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2024-05-29 07:00:13] [INFO ] Computed and/alt/rep : 262/723/262 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-29 07:00:15] [INFO ] Added : 242 causal constraints over 49 iterations in 1789 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 13 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-05-29 07:00:15] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 07:00:15] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-29 07:00:15] [INFO ] Invariant cache hit.
[2024-05-29 07:00:15] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2024-05-29 07:00:15] [INFO ] Redundant transitions in 2 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:00:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:00:22] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:00:26] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:00:27] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18439 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:00:59] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:01:01] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30018 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48489ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48494ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48908 ms. Remains : 311/313 places, 261/263 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 1916 steps (0 resets) in 27 ms. (68 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2024-05-29 07:01:04] [INFO ] Invariant cache hit.
[2024-05-29 07:01:04] [INFO ] [Real]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-05-29 07:01:05] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2024-05-29 07:01:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:01:05] [INFO ] [Nat]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-05-29 07:01:05] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2024-05-29 07:01:05] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-29 07:01:07] [INFO ] Added : 202 causal constraints over 41 iterations in 1860 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 6206 reset in 302 ms.
Product exploration explored 100000 steps with 5692 reset in 342 ms.
Built C files in :
/tmp/ltsmin10623846158841116703
[2024-05-29 07:01:08] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:01:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:01:08] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:01:08] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:01:08] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:01:08] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:01:08] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10623846158841116703
Running compilation step : cd /tmp/ltsmin10623846158841116703;'/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 591 ms.
Running link step : cd /tmp/ltsmin10623846158841116703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10623846158841116703;'/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/stateBased14065156636075975474.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 18 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:01:23] [INFO ] Invariant cache hit.
[2024-05-29 07:01:23] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-29 07:01:23] [INFO ] Invariant cache hit.
[2024-05-29 07:01:23] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2024-05-29 07:01:23] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:01:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:01:30] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:01:34] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:01:35] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18177 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:02:06] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:02:08] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30015 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48222ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48225ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48641 ms. Remains : 311/311 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin7506709931347359977
[2024-05-29 07:02:11] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:02:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:02:11] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:02:11] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:02:11] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:02:11] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:02:11] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7506709931347359977
Running compilation step : cd /tmp/ltsmin7506709931347359977;'/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 597 ms.
Running link step : cd /tmp/ltsmin7506709931347359977;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7506709931347359977;'/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/stateBased4769084993166115244.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 07:02:27] [INFO ] Flatten gal took : 14 ms
[2024-05-29 07:02:27] [INFO ] Flatten gal took : 12 ms
[2024-05-29 07:02:27] [INFO ] Time to serialize gal into /tmp/LTL1414730611470107503.gal : 2 ms
[2024-05-29 07:02:27] [INFO ] Time to serialize properties into /tmp/LTL14089982091319918562.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1414730611470107503.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13810812866451774409.hoa' '-atoms' '/tmp/LTL14089982091319918562.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14089982091319918562.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13810812866451774409.hoa
Detected timeout of ITS tools.
[2024-05-29 07:02:42] [INFO ] Flatten gal took : 10 ms
[2024-05-29 07:02:42] [INFO ] Flatten gal took : 11 ms
[2024-05-29 07:02:42] [INFO ] Time to serialize gal into /tmp/LTL270718948855141624.gal : 2 ms
[2024-05-29 07:02:42] [INFO ] Time to serialize properties into /tmp/LTL12528548754042953234.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/LTL270718948855141624.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12528548754042953234.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 : !((X((G(F("((p304==1)&&(p210==0))")))||((F("((p304==1)&&(p210==0))"))&&(G((F("(p42==1)"))&&(F("((p304==0)||(p210==1))"))))))))
Formula 0 simplified : X(FG!"((p304==1)&&(p210==0))" & (G!"((p304==1)&&(p210==0))" | F(G!"(p42==1)" | G!"((p304==0)||(p210==1))")))
Detected timeout of ITS tools.
[2024-05-29 07:02:57] [INFO ] Flatten gal took : 29 ms
[2024-05-29 07:02:57] [INFO ] Applying decomposition
[2024-05-29 07:02:57] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph630691340730128604.txt' '-o' '/tmp/graph630691340730128604.bin' '-w' '/tmp/graph630691340730128604.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph630691340730128604.bin' '-l' '-1' '-v' '-w' '/tmp/graph630691340730128604.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:02:57] [INFO ] Decomposing Gal with order
[2024-05-29 07:02:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:02:57] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 07:02:57] [INFO ] Flatten gal took : 30 ms
[2024-05-29 07:02:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 14 ms.
[2024-05-29 07:02:57] [INFO ] Time to serialize gal into /tmp/LTL11115382477351347842.gal : 9 ms
[2024-05-29 07:02:57] [INFO ] Time to serialize properties into /tmp/LTL18151521719277944129.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/LTL11115382477351347842.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18151521719277944129.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((i9.i3.u108.p304==1)&&(i6.i0.u75.p210==0))")))||((F("((i9.i3.u108.p304==1)&&(i6.i0.u75.p210==0))"))&&(G((F("(i1.i1.u15.p42...220
Formula 0 simplified : X(FG!"((i9.i3.u108.p304==1)&&(i6.i0.u75.p210==0))" & (G!"((i9.i3.u108.p304==1)&&(i6.i0.u75.p210==0))" | F(G!"(i1.i1.u15.p42==1)" | G...204
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-02 finished in 229283 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((p0&&F(p1))))'
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 6 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-05-29 07:03:12] [INFO ] Computed 111 invariants in 4 ms
[2024-05-29 07:03:12] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-29 07:03:12] [INFO ] Invariant cache hit.
[2024-05-29 07:03:12] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 07:03:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:03:18] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:03:22] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:03:22] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-29 07:03:23] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:03:23] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:03:23] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 07:03:23] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:03:24] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 18137 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:03:38] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30019 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 48186ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 48189ms
Finished structural reductions in LTL mode , in 1 iterations and 48601 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-010A-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-09 finished in 48765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 2 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-05-29 07:04:01] [INFO ] Invariant cache hit.
[2024-05-29 07:04:01] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-29 07:04:01] [INFO ] Invariant cache hit.
[2024-05-29 07:04:01] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 07:04:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:04:06] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:04:10] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:04:10] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-29 07:04:11] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:04:11] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:04:11] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-29 07:04:11] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:04:12] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 17602 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:04:27] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30012 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 47644ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 47646ms
Finished structural reductions in LTL mode , in 1 iterations and 48044 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-10
Product exploration explored 100000 steps with 2485 reset in 301 ms.
Product exploration explored 100000 steps with 2610 reset in 363 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 162 steps (0 resets) in 5 ms. (27 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 85 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 154 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
[2024-05-29 07:04:50] [INFO ] Invariant cache hit.
[2024-05-29 07:04:50] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2024-05-29 07:04:50] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2024-05-29 07:04:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:04:51] [INFO ] [Nat]Absence check using 111 positive place invariants in 23 ms returned sat
[2024-05-29 07:04:51] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2024-05-29 07:04:51] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-29 07:04:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-29 07:04:51] [INFO ] Computed and/alt/rep : 262/723/262 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-29 07:04:56] [INFO ] Added : 262 causal constraints over 53 iterations in 5000 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 21 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-05-29 07:04:56] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 07:04:56] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-29 07:04:56] [INFO ] Invariant cache hit.
[2024-05-29 07:04:56] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2024-05-29 07:04:56] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:04:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:05:03] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:05:08] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:05:09] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18729 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:05:40] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-29 07:05:42] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30020 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48785ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48788ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49221 ms. Remains : 311/313 places, 261/263 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 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 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 77 steps (0 resets) in 6 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 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)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2024-05-29 07:05:46] [INFO ] Invariant cache hit.
[2024-05-29 07:05:46] [INFO ] [Real]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-05-29 07:05:46] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2024-05-29 07:05:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:05:46] [INFO ] [Nat]Absence check using 111 positive place invariants in 24 ms returned sat
[2024-05-29 07:05:46] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2024-05-29 07:05:46] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-29 07:05:49] [INFO ] Added : 259 causal constraints over 55 iterations in 2982 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2402 reset in 329 ms.
Product exploration explored 100000 steps with 2377 reset in 356 ms.
Built C files in :
/tmp/ltsmin5158748622958905086
[2024-05-29 07:05:50] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:05:50] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:05:50] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:05:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:05:50] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:05:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:05:50] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5158748622958905086
Running compilation step : cd /tmp/ltsmin5158748622958905086;'/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 593 ms.
Running link step : cd /tmp/ltsmin5158748622958905086;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin5158748622958905086;'/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/stateBased8264526621880190835.hoa' '--buchi-type=spotba'
LTSmin run took 1080 ms.
FORMULA ShieldPPPs-PT-010A-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-10 finished in 111138 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))))'
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-05-29 07:05:52] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 07:05:52] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-29 07:05:52] [INFO ] Invariant cache hit.
[2024-05-29 07:05:52] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 07:05:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:05:58] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:06:01] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:06:02] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-29 07:06:02] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 07:06:02] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:06:02] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:06:02] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-29 07:06:04] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 17746 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:06:18] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30026 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 47801ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 47803ms
Finished structural reductions in LTL mode , in 1 iterations and 48210 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-12
Product exploration explored 100000 steps with 261 reset in 372 ms.
Product exploration explored 100000 steps with 267 reset in 401 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1644 steps (0 resets) in 21 ms. (74 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 07:06:41] [INFO ] Invariant cache hit.
[2024-05-29 07:06:42] [INFO ] [Real]Absence check using 111 positive place invariants in 25 ms returned sat
[2024-05-29 07:06:42] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2024-05-29 07:06:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:06:42] [INFO ] [Nat]Absence check using 111 positive place invariants in 21 ms returned sat
[2024-05-29 07:06:42] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2024-05-29 07:06:42] [INFO ] Computed and/alt/rep : 262/723/262 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-29 07:06:45] [INFO ] Added : 259 causal constraints over 60 iterations in 3054 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-05-29 07:06:45] [INFO ] Invariant cache hit.
[2024-05-29 07:06:45] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-29 07:06:45] [INFO ] Invariant cache hit.
[2024-05-29 07:06:46] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 07:06:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:06:51] [INFO ] Deduced a trap composed of 11 places in 15 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:06:55] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-29 07:06:55] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 0 ms to minimize.
[2024-05-29 07:06:55] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:06:55] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:06:55] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:06:55] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-29 07:06:57] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 17560 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:07:11] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30015 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 47603ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 47605ms
Finished structural reductions in LTL mode , in 1 iterations and 47983 ms. Remains : 313/313 places, 263/263 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1530 steps (0 resets) in 23 ms. (63 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 07:07:34] [INFO ] Invariant cache hit.
[2024-05-29 07:07:34] [INFO ] [Real]Absence check using 111 positive place invariants in 25 ms returned sat
[2024-05-29 07:07:34] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2024-05-29 07:07:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:07:34] [INFO ] [Nat]Absence check using 111 positive place invariants in 22 ms returned sat
[2024-05-29 07:07:34] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2024-05-29 07:07:34] [INFO ] Computed and/alt/rep : 262/723/262 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-29 07:07:37] [INFO ] Added : 259 causal constraints over 60 iterations in 3125 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 268 reset in 370 ms.
Product exploration explored 100000 steps with 267 reset in 404 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 313 transition count 263
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 48 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-05-29 07:07:39] [INFO ] Redundant transitions in 1 ms returned []
Running 262 sub problems to find dead transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-05-29 07:07:39] [INFO ] Computed 111 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:07:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-05-29 07:07:43] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 2/426 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/426 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/739 constraints. Problems are: Problem set: 2 solved, 260 unsolved
[2024-05-29 07:07:47] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 1/740 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/740 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/740 constraints. Problems are: Problem set: 2 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 740 constraints, problems are : Problem set: 2 solved, 260 unsolved in 16579 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 2 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 3/313 variables, 111/421 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 3/424 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 3/427 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/427 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/740 constraints. Problems are: Problem set: 2 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 260/1000 constraints. Problems are: Problem set: 2 solved, 260 unsolved
[2024-05-29 07:08:02] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:08:02] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 2/1002 constraints. Problems are: Problem set: 2 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1002 constraints, problems are : Problem set: 2 solved, 260 unsolved in 30013 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 260/262 constraints, Known Traps: 5/5 constraints]
After SMT, in 46622ms problems are : Problem set: 2 solved, 260 unsolved
Search for dead transitions found 2 dead transitions in 46624ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 313/313 places, 261/263 transitions.
Graph (complete) has 822 edges and 313 vertex of which 311 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 311 /313 variables (removed 2) and now considering 261/261 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46692 ms. Remains : 311/313 places, 261/263 transitions.
Built C files in :
/tmp/ltsmin5093340426048528376
[2024-05-29 07:08:25] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5093340426048528376
Running compilation step : cd /tmp/ltsmin5093340426048528376;'/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 478 ms.
Running link step : cd /tmp/ltsmin5093340426048528376;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5093340426048528376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7970064815952114846.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 10 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-05-29 07:08:40] [INFO ] Computed 111 invariants in 1 ms
[2024-05-29 07:08:41] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-29 07:08:41] [INFO ] Invariant cache hit.
[2024-05-29 07:08:41] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 07:08:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:08:46] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:08:50] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:08:50] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-29 07:08:51] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-29 07:08:51] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 07:08:51] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:08:51] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 07:08:52] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 17442 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:09:06] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30011 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 47481ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 47483ms
Finished structural reductions in LTL mode , in 1 iterations and 47904 ms. Remains : 313/313 places, 263/263 transitions.
Built C files in :
/tmp/ltsmin6270296433713856896
[2024-05-29 07:09:28] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6270296433713856896
Running compilation step : cd /tmp/ltsmin6270296433713856896;'/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 481 ms.
Running link step : cd /tmp/ltsmin6270296433713856896;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6270296433713856896;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4669721840699198357.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 07:09:43] [INFO ] Flatten gal took : 9 ms
[2024-05-29 07:09:43] [INFO ] Flatten gal took : 9 ms
[2024-05-29 07:09:43] [INFO ] Time to serialize gal into /tmp/LTL15547057136943512014.gal : 2 ms
[2024-05-29 07:09:43] [INFO ] Time to serialize properties into /tmp/LTL229608760636570395.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15547057136943512014.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13248560536482556726.hoa' '-atoms' '/tmp/LTL229608760636570395.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/LTL229608760636570395.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13248560536482556726.hoa
Detected timeout of ITS tools.
[2024-05-29 07:09:58] [INFO ] Flatten gal took : 9 ms
[2024-05-29 07:09:58] [INFO ] Flatten gal took : 13 ms
[2024-05-29 07:09:58] [INFO ] Time to serialize gal into /tmp/LTL16093465887831421940.gal : 2 ms
[2024-05-29 07:09:58] [INFO ] Time to serialize properties into /tmp/LTL7548746735883403330.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/LTL16093465887831421940.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7548746735883403330.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(p37==1)")))))
Formula 0 simplified : XXG!"(p37==1)"
Detected timeout of ITS tools.
[2024-05-29 07:10:14] [INFO ] Flatten gal took : 14 ms
[2024-05-29 07:10:14] [INFO ] Applying decomposition
[2024-05-29 07:10:14] [INFO ] Flatten gal took : 8 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/graph674473216563439851.txt' '-o' '/tmp/graph674473216563439851.bin' '-w' '/tmp/graph674473216563439851.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph674473216563439851.bin' '-l' '-1' '-v' '-w' '/tmp/graph674473216563439851.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:10:14] [INFO ] Decomposing Gal with order
[2024-05-29 07:10:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:10:14] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 07:10:14] [INFO ] Flatten gal took : 15 ms
[2024-05-29 07:10:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 9 ms.
[2024-05-29 07:10:14] [INFO ] Time to serialize gal into /tmp/LTL18390030609475792374.gal : 3 ms
[2024-05-29 07:10:14] [INFO ] Time to serialize properties into /tmp/LTL870668896791281774.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/LTL18390030609475792374.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL870668896791281774.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(i1.i1.u13.p37==1)")))))
Formula 0 simplified : XXG!"(i1.i1.u13.p37==1)"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-12 finished in 276817 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 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 12 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-05-29 07:10:29] [INFO ] Computed 111 invariants in 1 ms
[2024-05-29 07:10:29] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-29 07:10:29] [INFO ] Invariant cache hit.
[2024-05-29 07:10:29] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-05-29 07:10:29] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:10:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:10:36] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:10:40] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:10:41] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18781 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:11:13] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:11:15] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30022 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48831ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48833ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49243 ms. Remains : 311/313 places, 261/263 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-14
Stuttering criterion allowed to conclude after 21450 steps with 29 reset in 96 ms.
FORMULA ShieldPPPs-PT-010A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-14 finished in 49431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 3 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2024-05-29 07:11:18] [INFO ] Computed 111 invariants in 1 ms
[2024-05-29 07:11:18] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-29 07:11:18] [INFO ] Invariant cache hit.
[2024-05-29 07:11:18] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-29 07:11:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/576 variables, 313/737 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:11:24] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:11:28] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:11:28] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 1 ms to minimize.
[2024-05-29 07:11:28] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:11:28] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-29 07:11:29] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:11:29] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-29 07:11:30] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 0/576 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 745 constraints, problems are : Problem set: 0 solved, 262 unsolved in 17766 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 312/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 111/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/576 variables, 313/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 262/1007 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-29 07:11:44] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/576 variables, and 1008 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30020 ms.
Refiners :[Domain max(s): 313/313 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 9/9 constraints]
After SMT, in 47816ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 47818ms
Finished structural reductions in LTL mode , in 1 iterations and 48204 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 92 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-010A-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-15 finished in 48308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : ShieldPPPs-PT-010A-LTLCardinality-01
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 15 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2024-05-29 07:12:07] [INFO ] Computed 111 invariants in 1 ms
[2024-05-29 07:12:07] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-29 07:12:07] [INFO ] Invariant cache hit.
[2024-05-29 07:12:07] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-05-29 07:12:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:12:14] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:12:18] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 07:12:19] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18501 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:12:51] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-29 07:12:53] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30017 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48544ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48546ms
Starting structural reductions in LI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 48981 ms. Remains : 311/313 places, 261/263 transitions.
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-01
Product exploration explored 100000 steps with 694 reset in 358 ms.
Product exploration explored 100000 steps with 697 reset in 399 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:12:57] [INFO ] Invariant cache hit.
[2024-05-29 07:12:57] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-29 07:12:57] [INFO ] Invariant cache hit.
[2024-05-29 07:12:57] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2024-05-29 07:12:57] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:12:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:13:04] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:13:09] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-29 07:13:10] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19196 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:13:42] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-29 07:13:44] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30013 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 49241ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49244ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49684 ms. Remains : 311/311 places, 261/261 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 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 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 89 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 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 714 reset in 320 ms.
Product exploration explored 100000 steps with 722 reset in 360 ms.
Built C files in :
/tmp/ltsmin3766982643121070448
[2024-05-29 07:13:47] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:13:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:13:47] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:13:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:13:47] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:13:47] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:13:47] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3766982643121070448
Running compilation step : cd /tmp/ltsmin3766982643121070448;'/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 592 ms.
Running link step : cd /tmp/ltsmin3766982643121070448;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3766982643121070448;'/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/stateBased12359474209812999515.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 17 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:14:03] [INFO ] Invariant cache hit.
[2024-05-29 07:14:03] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-29 07:14:03] [INFO ] Invariant cache hit.
[2024-05-29 07:14:03] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2024-05-29 07:14:03] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:14:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:14:10] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:14:14] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:14:16] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19181 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:14:47] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-29 07:14:49] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30031 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 49249ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 49251ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49675 ms. Remains : 311/311 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin15952316844225545032
[2024-05-29 07:14:52] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:14:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:14:52] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:14:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:14:52] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:14:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:14:52] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15952316844225545032
Running compilation step : cd /tmp/ltsmin15952316844225545032;'/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 589 ms.
Running link step : cd /tmp/ltsmin15952316844225545032;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15952316844225545032;'/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/stateBased8518671020001614371.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 07:15:07] [INFO ] Flatten gal took : 8 ms
[2024-05-29 07:15:07] [INFO ] Flatten gal took : 9 ms
[2024-05-29 07:15:07] [INFO ] Time to serialize gal into /tmp/LTL10762202681891310213.gal : 2 ms
[2024-05-29 07:15:07] [INFO ] Time to serialize properties into /tmp/LTL831846629761818538.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/LTL10762202681891310213.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1660174300086862699.hoa' '-atoms' '/tmp/LTL831846629761818538.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL831846629761818538.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1660174300086862699.hoa
Detected timeout of ITS tools.
[2024-05-29 07:15:22] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:15:22] [INFO ] Flatten gal took : 8 ms
[2024-05-29 07:15:22] [INFO ] Time to serialize gal into /tmp/LTL9738298104215313059.gal : 2 ms
[2024-05-29 07:15:22] [INFO ] Time to serialize properties into /tmp/LTL5185352755769859637.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/LTL9738298104215313059.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5185352755769859637.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 : !((X(F("((p160==0)||(p138==1))"))))
Formula 0 simplified : XG!"((p160==0)||(p138==1))"
Detected timeout of ITS tools.
[2024-05-29 07:15:37] [INFO ] Flatten gal took : 12 ms
[2024-05-29 07:15:37] [INFO ] Applying decomposition
[2024-05-29 07:15:38] [INFO ] Flatten gal took : 8 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/graph6052000442659731857.txt' '-o' '/tmp/graph6052000442659731857.bin' '-w' '/tmp/graph6052000442659731857.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6052000442659731857.bin' '-l' '-1' '-v' '-w' '/tmp/graph6052000442659731857.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:15:38] [INFO ] Decomposing Gal with order
[2024-05-29 07:15:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:15:38] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 07:15:38] [INFO ] Flatten gal took : 15 ms
[2024-05-29 07:15:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 4 ms.
[2024-05-29 07:15:38] [INFO ] Time to serialize gal into /tmp/LTL719078096070369869.gal : 3 ms
[2024-05-29 07:15:38] [INFO ] Time to serialize properties into /tmp/LTL13682215242800433855.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/LTL719078096070369869.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13682215242800433855.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F("((i5.i1.u57.p160==0)||(i4.i3.u49.p138==1))"))))
Formula 0 simplified : XG!"((i5.i1.u57.p160==0)||(i4.i3.u49.p138==1))"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-01 finished in 226234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0))||(F(!p0)&&G((F(p1)&&F(p0)))))))'
Found a Shortening insensitive property : ShieldPPPs-PT-010A-LTLCardinality-02
Stuttering acceptance computed with spot in 186 ms :[p0, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 14 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
[2024-05-29 07:15:53] [INFO ] Invariant cache hit.
[2024-05-29 07:15:53] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-29 07:15:53] [INFO ] Invariant cache hit.
[2024-05-29 07:15:53] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-05-29 07:15:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:16:00] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:16:04] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:16:05] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18668 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:16:37] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:16:39] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30011 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48707ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48710ms
Starting structural reductions in LI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 49107 ms. Remains : 311/313 places, 261/263 transitions.
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-02
Product exploration explored 100000 steps with 3194 reset in 296 ms.
Product exploration explored 100000 steps with 3047 reset in 336 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 1827 steps (0 resets) in 21 ms. (83 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2024-05-29 07:16:43] [INFO ] Invariant cache hit.
[2024-05-29 07:16:43] [INFO ] [Real]Absence check using 111 positive place invariants in 28 ms returned sat
[2024-05-29 07:16:44] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2024-05-29 07:16:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:16:44] [INFO ] [Nat]Absence check using 111 positive place invariants in 28 ms returned sat
[2024-05-29 07:16:44] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2024-05-29 07:16:44] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-29 07:16:46] [INFO ] Added : 202 causal constraints over 41 iterations in 1897 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Support contains 3 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 10 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:16:46] [INFO ] Invariant cache hit.
[2024-05-29 07:16:46] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-29 07:16:46] [INFO ] Invariant cache hit.
[2024-05-29 07:16:46] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2024-05-29 07:16:46] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:16:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:16:53] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:16:58] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:16:59] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18613 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:17:30] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:17:32] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30019 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48659ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48661ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49058 ms. Remains : 311/311 places, 261/261 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 1734 steps (0 resets) in 13 ms. (123 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2024-05-29 07:17:36] [INFO ] Invariant cache hit.
[2024-05-29 07:17:36] [INFO ] [Real]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-05-29 07:17:36] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2024-05-29 07:17:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:17:36] [INFO ] [Nat]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-05-29 07:17:36] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2024-05-29 07:17:36] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-29 07:17:38] [INFO ] Added : 202 causal constraints over 41 iterations in 1889 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 73 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 6189 reset in 299 ms.
Product exploration explored 100000 steps with 6041 reset in 349 ms.
Built C files in :
/tmp/ltsmin8550533544595111898
[2024-05-29 07:17:39] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:17:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:17:39] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:17:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:17:39] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:17:39] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:17:39] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8550533544595111898
Running compilation step : cd /tmp/ltsmin8550533544595111898;'/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 593 ms.
Running link step : cd /tmp/ltsmin8550533544595111898;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin8550533544595111898;'/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/stateBased15061041088343198155.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 12 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-29 07:17:54] [INFO ] Invariant cache hit.
[2024-05-29 07:17:54] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-29 07:17:54] [INFO ] Invariant cache hit.
[2024-05-29 07:17:55] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-05-29 07:17:55] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2024-05-29 07:17:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/572 variables, 311/733 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:18:01] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:18:06] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:18:07] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/572 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 736 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18346 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 261/572 variables, 311/736 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 260/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-29 07:18:38] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:18:40] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 998 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30018 ms.
Refiners :[Domain max(s): 311/311 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 5/5 constraints]
After SMT, in 48392ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48394ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48783 ms. Remains : 311/311 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin17025273673898559546
[2024-05-29 07:18:43] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2024-05-29 07:18:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:18:43] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2024-05-29 07:18:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:18:43] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2024-05-29 07:18:43] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:18:43] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17025273673898559546
Running compilation step : cd /tmp/ltsmin17025273673898559546;'/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 600 ms.
Running link step : cd /tmp/ltsmin17025273673898559546;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17025273673898559546;'/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/stateBased7283035215623561651.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 07:18:58] [INFO ] Flatten gal took : 8 ms
[2024-05-29 07:18:58] [INFO ] Flatten gal took : 8 ms
[2024-05-29 07:18:58] [INFO ] Time to serialize gal into /tmp/LTL17927786327824574668.gal : 1 ms
[2024-05-29 07:18:58] [INFO ] Time to serialize properties into /tmp/LTL13161069218487241213.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17927786327824574668.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4794246538194884941.hoa' '-atoms' '/tmp/LTL13161069218487241213.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13161069218487241213.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4794246538194884941.hoa
Detected timeout of ITS tools.
[2024-05-29 07:19:13] [INFO ] Flatten gal took : 8 ms
[2024-05-29 07:19:13] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:19:13] [INFO ] Time to serialize gal into /tmp/LTL18386260955003142446.gal : 2 ms
[2024-05-29 07:19:13] [INFO ] Time to serialize properties into /tmp/LTL18150123985883580565.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/LTL18386260955003142446.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18150123985883580565.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((p304==1)&&(p210==0))")))||((F("((p304==1)&&(p210==0))"))&&(G((F("(p42==1)"))&&(F("((p304==0)||(p210==1))"))))))))
Formula 0 simplified : X(FG!"((p304==1)&&(p210==0))" & (G!"((p304==1)&&(p210==0))" | F(G!"(p42==1)" | G!"((p304==0)||(p210==1))")))
Detected timeout of ITS tools.
[2024-05-29 07:19:28] [INFO ] Flatten gal took : 8 ms
[2024-05-29 07:19:28] [INFO ] Applying decomposition
[2024-05-29 07:19:28] [INFO ] Flatten gal took : 7 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/graph17981930218534242997.txt' '-o' '/tmp/graph17981930218534242997.bin' '-w' '/tmp/graph17981930218534242997.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17981930218534242997.bin' '-l' '-1' '-v' '-w' '/tmp/graph17981930218534242997.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:19:28] [INFO ] Decomposing Gal with order
[2024-05-29 07:19:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:19:28] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 07:19:28] [INFO ] Flatten gal took : 14 ms
[2024-05-29 07:19:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 4 ms.
[2024-05-29 07:19:28] [INFO ] Time to serialize gal into /tmp/LTL7971087988966926446.gal : 3 ms
[2024-05-29 07:19:28] [INFO ] Time to serialize properties into /tmp/LTL18427912788420037807.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/LTL7971087988966926446.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18427912788420037807.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 : !((X((G(F("((i9.i0.u108.p304==1)&&(i6.i1.u75.p210==0))")))||((F("((i9.i0.u108.p304==1)&&(i6.i1.u75.p210==0))"))&&(G((F("(i1.i1.u15.p42...220
Formula 0 simplified : X(FG!"((i9.i0.u108.p304==1)&&(i6.i1.u75.p210==0))" & (G!"((i9.i0.u108.p304==1)&&(i6.i1.u75.p210==0))" | F(G!"(i1.i1.u15.p42==1)" | G...204
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-02 finished in 230733 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))))'
Found a Shortening insensitive property : ShieldPPPs-PT-010A-LTLCardinality-12
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 311 transition count 261
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 310 transition count 260
Applied a total of 4 rules in 19 ms. Remains 310 /313 variables (removed 3) and now considering 260/263 (removed 3) transitions.
// Phase 1: matrix 260 rows 310 cols
[2024-05-29 07:19:44] [INFO ] Computed 111 invariants in 1 ms
[2024-05-29 07:19:44] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-29 07:19:44] [INFO ] Invariant cache hit.
[2024-05-29 07:19:44] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2024-05-29 07:19:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 260/570 variables, 310/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:19:50] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-29 07:19:50] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-29 07:19:50] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:19:50] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 07:19:50] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:19:50] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-29 07:19:51] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-29 07:19:51] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-29 07:19:51] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-29 07:19:51] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-29 07:19:51] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-29 07:19:51] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-29 07:19:51] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-29 07:19:51] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:19:51] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/570 variables, 15/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 746 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13301 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 15/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 260/570 variables, 310/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 258/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:20:11] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/570 variables, 1/1005 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 1005 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30013 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 16/16 constraints]
After SMT, in 43341ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 43343ms
Starting structural reductions in LI_LTL mode, iteration 1 : 310/313 places, 260/263 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 43738 ms. Remains : 310/313 places, 260/263 transitions.
Running random walk in product with property : ShieldPPPs-PT-010A-LTLCardinality-12
Product exploration explored 100000 steps with 275 reset in 371 ms.
Product exploration explored 100000 steps with 278 reset in 411 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1690 steps (0 resets) in 16 ms. (99 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 07:20:29] [INFO ] Invariant cache hit.
[2024-05-29 07:20:29] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2024-05-29 07:20:29] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2024-05-29 07:20:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:20:29] [INFO ] [Nat]Absence check using 111 positive place invariants in 21 ms returned sat
[2024-05-29 07:20:29] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2024-05-29 07:20:29] [INFO ] Computed and/alt/rep : 258/493/258 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-29 07:20:33] [INFO ] Added : 257 causal constraints over 53 iterations in 4026 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 260/260 transitions.
Applied a total of 0 rules in 7 ms. Remains 310 /310 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-29 07:20:33] [INFO ] Invariant cache hit.
[2024-05-29 07:20:34] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-29 07:20:34] [INFO ] Invariant cache hit.
[2024-05-29 07:20:34] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2024-05-29 07:20:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 260/570 variables, 310/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:20:40] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:20:40] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:20:40] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:20:40] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:20:40] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 07:20:40] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 07:20:40] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:20:40] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:20:40] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-29 07:20:40] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-05-29 07:20:41] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:20:41] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-29 07:20:41] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:20:41] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-05-29 07:20:41] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/570 variables, 15/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 746 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13487 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 15/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 260/570 variables, 310/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 258/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:21:01] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/570 variables, 1/1005 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 1005 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30011 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 16/16 constraints]
After SMT, in 43524ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 43526ms
Finished structural reductions in LTL mode , in 1 iterations and 43908 ms. Remains : 310/310 places, 260/260 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1591 steps (0 resets) in 15 ms. (99 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 07:21:18] [INFO ] Invariant cache hit.
[2024-05-29 07:21:18] [INFO ] [Real]Absence check using 111 positive place invariants in 24 ms returned sat
[2024-05-29 07:21:18] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2024-05-29 07:21:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 07:21:18] [INFO ] [Nat]Absence check using 111 positive place invariants in 21 ms returned sat
[2024-05-29 07:21:19] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2024-05-29 07:21:19] [INFO ] Computed and/alt/rep : 258/493/258 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-29 07:21:23] [INFO ] Added : 257 causal constraints over 53 iterations in 4316 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 276 reset in 360 ms.
Product exploration explored 100000 steps with 275 reset in 425 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 260/260 transitions.
Applied a total of 0 rules in 8 ms. Remains 310 /310 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-29 07:21:24] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-29 07:21:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 260/570 variables, 310/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:21:30] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 07:21:30] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:21:30] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:21:30] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-29 07:21:30] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:21:30] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-29 07:21:31] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-29 07:21:31] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 07:21:31] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-29 07:21:31] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-05-29 07:21:31] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-29 07:21:31] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:21:31] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-29 07:21:31] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-29 07:21:32] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/570 variables, 15/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 746 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13418 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 15/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 260/570 variables, 310/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 258/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:21:51] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/570 variables, 1/1005 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 1005 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30014 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 16/16 constraints]
After SMT, in 43456ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 43459ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43480 ms. Remains : 310/310 places, 260/260 transitions.
Built C files in :
/tmp/ltsmin11600744272355950217
[2024-05-29 07:22:07] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11600744272355950217
Running compilation step : cd /tmp/ltsmin11600744272355950217;'/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 471 ms.
Running link step : cd /tmp/ltsmin11600744272355950217;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11600744272355950217;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16349370924954423841.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 260/260 transitions.
Applied a total of 0 rules in 2 ms. Remains 310 /310 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-29 07:22:22] [INFO ] Invariant cache hit.
[2024-05-29 07:22:23] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-29 07:22:23] [INFO ] Invariant cache hit.
[2024-05-29 07:22:23] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2024-05-29 07:22:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 260/570 variables, 310/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:22:29] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 07:22:29] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-29 07:22:29] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:22:29] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 07:22:29] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-29 07:22:29] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 07:22:30] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-29 07:22:30] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-29 07:22:30] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-29 07:22:30] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-29 07:22:30] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 07:22:30] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-29 07:22:30] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-29 07:22:30] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-29 07:22:30] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/570 variables, 15/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/570 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 746 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13642 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 111/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 15/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 260/570 variables, 310/746 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 258/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 07:22:50] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/570 variables, 1/1005 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/570 variables, and 1005 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30009 ms.
Refiners :[Domain max(s): 310/310 constraints, Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 16/16 constraints]
After SMT, in 43678ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 43680ms
Finished structural reductions in LTL mode , in 1 iterations and 44083 ms. Remains : 310/310 places, 260/260 transitions.
Built C files in :
/tmp/ltsmin11586535685857279172
[2024-05-29 07:23:07] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11586535685857279172
Running compilation step : cd /tmp/ltsmin11586535685857279172;'/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 497 ms.
Running link step : cd /tmp/ltsmin11586535685857279172;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11586535685857279172;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18165661037096789499.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 07:23:22] [INFO ] Flatten gal took : 6 ms
[2024-05-29 07:23:22] [INFO ] Flatten gal took : 6 ms
[2024-05-29 07:23:22] [INFO ] Time to serialize gal into /tmp/LTL13656966876696176770.gal : 2 ms
[2024-05-29 07:23:22] [INFO ] Time to serialize properties into /tmp/LTL13668498448315870300.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/LTL13656966876696176770.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10611474158427645769.hoa' '-atoms' '/tmp/LTL13668498448315870300.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13668498448315870300.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10611474158427645769.hoa
Detected timeout of ITS tools.
[2024-05-29 07:23:37] [INFO ] Flatten gal took : 7 ms
[2024-05-29 07:23:37] [INFO ] Flatten gal took : 6 ms
[2024-05-29 07:23:37] [INFO ] Time to serialize gal into /tmp/LTL15041374105140026585.gal : 2 ms
[2024-05-29 07:23:37] [INFO ] Time to serialize properties into /tmp/LTL7602071206263666758.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/LTL15041374105140026585.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7602071206263666758.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(p37==1)")))))
Formula 0 simplified : XXG!"(p37==1)"
Detected timeout of ITS tools.
[2024-05-29 07:23:52] [INFO ] Flatten gal took : 14 ms
[2024-05-29 07:23:52] [INFO ] Applying decomposition
[2024-05-29 07:23:52] [INFO ] Flatten gal took : 7 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/graph8903608488314517926.txt' '-o' '/tmp/graph8903608488314517926.bin' '-w' '/tmp/graph8903608488314517926.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8903608488314517926.bin' '-l' '-1' '-v' '-w' '/tmp/graph8903608488314517926.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:23:52] [INFO ] Decomposing Gal with order
[2024-05-29 07:23:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:23:52] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 07:23:52] [INFO ] Flatten gal took : 13 ms
[2024-05-29 07:23:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 2 ms.
[2024-05-29 07:23:52] [INFO ] Time to serialize gal into /tmp/LTL13896552230436047904.gal : 2 ms
[2024-05-29 07:23:52] [INFO ] Time to serialize properties into /tmp/LTL8906470679795306931.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/LTL13896552230436047904.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8906470679795306931.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 : !((X(X(F("(i1.i2.u13.p37==1)")))))
Formula 0 simplified : XXG!"(i1.i2.u13.p37==1)"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010A-LTLCardinality-12 finished in 263571 ms.
[2024-05-29 07:24:07] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2759443101078445436
[2024-05-29 07:24:07] [INFO ] Computing symmetric may disable matrix : 263 transitions.
[2024-05-29 07:24:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:24:07] [INFO ] Applying decomposition
[2024-05-29 07:24:07] [INFO ] Computing symmetric may enable matrix : 263 transitions.
[2024-05-29 07:24:07] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:24:07] [INFO ] Flatten gal took : 10 ms
[2024-05-29 07:24:07] [INFO ] Computing Do-Not-Accords matrix : 263 transitions.
[2024-05-29 07:24:07] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:24:07] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2759443101078445436
Running compilation step : cd /tmp/ltsmin2759443101078445436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' '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'
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/graph4622301573021966237.txt' '-o' '/tmp/graph4622301573021966237.bin' '-w' '/tmp/graph4622301573021966237.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4622301573021966237.bin' '-l' '-1' '-v' '-w' '/tmp/graph4622301573021966237.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:24:07] [INFO ] Decomposing Gal with order
[2024-05-29 07:24:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:24:07] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 07:24:07] [INFO ] Flatten gal took : 30 ms
[2024-05-29 07:24:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 14 ms.
[2024-05-29 07:24:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality14815966030165864154.gal : 2 ms
[2024-05-29 07:24:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality6195373643819483829.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/LTLCardinality14815966030165864154.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6195373643819483829.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 3 LTL properties
Checking formula 0 : !((X(F("((i5.i0.u57.p160==0)||(i4.i2.u49.p138==1))"))))
Formula 0 simplified : XG!"((i5.i0.u57.p160==0)||(i4.i2.u49.p138==1))"
Compilation finished in 621 ms.
Running link step : cd /tmp/ltsmin2759443101078445436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2759443101078445436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin2759443101078445436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2759443101078445436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>(!(LTLAPp1==true)))||(<>(!(LTLAPp1==true))&&[]((<>((LTLAPp2==true))&&<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin2759443101078445436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>(!(LTLAPp1==true)))||(<>(!(LTLAPp1==true))&&[]((<>((LTLAPp2==true))&&<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2759443101078445436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin2759443101078445436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((LTLAPp3==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin2759443101078445436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 07:53:54] [INFO ] Applying decomposition
[2024-05-29 07:53:54] [INFO ] Flatten gal took : 15 ms
[2024-05-29 07:53:54] [INFO ] Decomposing Gal with order
[2024-05-29 07:53:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:53:54] [INFO ] Removed a total of 90 redundant transitions.
[2024-05-29 07:53:54] [INFO ] Flatten gal took : 40 ms
[2024-05-29 07:53:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 4 ms.
[2024-05-29 07:53:54] [INFO ] Time to serialize gal into /tmp/LTLCardinality12244599293668686450.gal : 3 ms
[2024-05-29 07:53:54] [INFO ] Time to serialize properties into /tmp/LTLCardinality10848500649921461479.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/LTLCardinality12244599293668686450.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10848500649921461479.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !((X(F("((i42.u142.p160==0)||(i35.u64.p138==1))"))))
Formula 0 simplified : XG!"((i42.u142.p160==0)||(i35.u64.p138==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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-010A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-010A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683761100435"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-010A.tgz
mv ShieldPPPs-PT-010A execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;