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.r135-tall-171631131500636.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 greatspnxred
Input is DoubleLock-PT-p3s2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131500636
=====================================================================

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716398052158

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p3s2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 17:14:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 17:14:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 17:14:13] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2024-05-22 17:14:13] [INFO ] Transformed 112 places.
[2024-05-22 17:14:13] [INFO ] Transformed 744 transitions.
[2024-05-22 17:14:13] [INFO ] Parsed PT model containing 112 places and 744 transitions and 3008 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 32 transitions.
FORMULA DoubleLock-PT-p3s2-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 712/712 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 89 transition count 712
Applied a total of 3 rules in 32 ms. Remains 89 /92 variables (removed 3) and now considering 712/712 (removed 0) transitions.
[2024-05-22 17:14:13] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
// Phase 1: matrix 515 rows 89 cols
[2024-05-22 17:14:13] [INFO ] Computed 2 invariants in 22 ms
[2024-05-22 17:14:14] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-22 17:14:14] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2024-05-22 17:14:14] [INFO ] Invariant cache hit.
[2024-05-22 17:14:14] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-22 17:14:14] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Running 710 sub problems to find dead transitions.
[2024-05-22 17:14:14] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
[2024-05-22 17:14:14] [INFO ] Invariant cache hit.
[2024-05-22 17:14:14] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/604 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 138 constraints, problems are : Problem set: 0 solved, 710 unsolved in 21567 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 710 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 3 (OVERLAPS) 515/604 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 710 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/604 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 710 unsolved
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 710/848 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 0/848 constraints. Problems are: Problem set: 144 solved, 566 unsolved
At refinement iteration 7 (OVERLAPS) 0/604 variables, 0/848 constraints. Problems are: Problem set: 144 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 604/604 variables, and 848 constraints, problems are : Problem set: 144 solved, 566 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 710/710 constraints, Known Traps: 0/0 constraints]
After SMT, in 52424ms problems are : Problem set: 144 solved, 566 unsolved
Search for dead transitions found 144 dead transitions in 52446ms
Found 144 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in LTL mode, iteration 1 : 89/92 places, 568/712 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 84 transition count 568
Applied a total of 5 rules in 5 ms. Remains 84 /89 variables (removed 5) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:15:06] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 84 cols
[2024-05-22 17:15:06] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 17:15:06] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 17:15:06] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:15:06] [INFO ] Invariant cache hit.
[2024-05-22 17:15:06] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:15:07] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 84/92 places, 568/712 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53350 ms. Remains : 84/92 places, 568/712 transitions.
Support contains 30 out of 84 places after structural reductions.
[2024-05-22 17:15:07] [INFO ] Flatten gal took : 68 ms
[2024-05-22 17:15:07] [INFO ] Flatten gal took : 36 ms
[2024-05-22 17:15:07] [INFO ] Input system was already deterministic with 568 transitions.
RANDOM walk for 40007 steps (465 resets) in 1511 ms. (26 steps per ms) remains 9/21 properties
BEST_FIRST walk for 40004 steps (100 resets) in 152 ms. (261 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40004 steps (113 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (97 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (86 resets) in 155 ms. (256 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (83 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
[2024-05-22 17:15:08] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:15:08] [INFO ] Invariant cache hit.
[2024-05-22 17:15:08] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 123/133 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 320/453 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 41/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 20/473 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/473 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 126 constraints, problems are : Problem set: 0 solved, 5 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 123/133 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 320/453 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 41/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp11 is UNSAT
At refinement iteration 8 (OVERLAPS) 20/473 variables, 20/131 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 0/131 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/473 variables, 0/131 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 473/473 variables, and 131 constraints, problems are : Problem set: 3 solved, 2 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 643ms problems are : Problem set: 3 solved, 2 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 568/568 transitions.
Graph (complete) has 931 edges and 84 vertex of which 82 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 82 transition count 561
Applied a total of 8 rules in 30 ms. Remains 82 /84 variables (removed 2) and now considering 561/568 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 82/84 places, 561/568 transitions.
RANDOM walk for 40008 steps (467 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (88 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (80 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1153810 steps, run timeout after 3001 ms. (steps per millisecond=384 ) properties seen :1 out of 2
Probabilistic random walk after 1153810 steps, saw 798379 distinct states, run finished after 3005 ms. (steps per millisecond=383 ) properties seen :1
[2024-05-22 17:15:11] [INFO ] Flow matrix only has 382 transitions (discarded 179 similar events)
// Phase 1: matrix 382 rows 82 cols
[2024-05-22 17:15:11] [INFO ] Computed 1 invariants in 7 ms
[2024-05-22 17:15:11] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 384/433 variables, 47/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 41/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 31/464 variables, 31/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/464 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 124 constraints, problems are : Problem set: 0 solved, 1 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 384/433 variables, 47/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 41/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 31/464 variables, 31/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/464 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 312ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 561/561 transitions.
Applied a total of 0 rules in 17 ms. Remains 82 /82 variables (removed 0) and now considering 561/561 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 82/82 places, 561/561 transitions.
RANDOM walk for 40013 steps (473 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (88 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1188034 steps, run timeout after 3001 ms. (steps per millisecond=395 ) properties seen :0 out of 1
Probabilistic random walk after 1188034 steps, saw 825978 distinct states, run finished after 3001 ms. (steps per millisecond=395 ) properties seen :0
[2024-05-22 17:15:15] [INFO ] Flow matrix only has 382 transitions (discarded 179 similar events)
[2024-05-22 17:15:15] [INFO ] Invariant cache hit.
[2024-05-22 17:15:15] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 384/433 variables, 47/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 41/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 31/464 variables, 31/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/464 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 124 constraints, problems are : Problem set: 0 solved, 1 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 384/433 variables, 47/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 41/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 31/464 variables, 31/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/464 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 293ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 561/561 transitions.
Applied a total of 0 rules in 11 ms. Remains 82 /82 variables (removed 0) and now considering 561/561 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 82/82 places, 561/561 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 561/561 transitions.
Applied a total of 0 rules in 11 ms. Remains 82 /82 variables (removed 0) and now considering 561/561 (removed 0) transitions.
[2024-05-22 17:15:15] [INFO ] Flow matrix only has 382 transitions (discarded 179 similar events)
[2024-05-22 17:15:15] [INFO ] Invariant cache hit.
[2024-05-22 17:15:15] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-22 17:15:15] [INFO ] Flow matrix only has 382 transitions (discarded 179 similar events)
[2024-05-22 17:15:15] [INFO ] Invariant cache hit.
[2024-05-22 17:15:15] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:15:15] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-05-22 17:15:16] [INFO ] Redundant transitions in 37 ms returned []
Running 559 sub problems to find dead transitions.
[2024-05-22 17:15:16] [INFO ] Flow matrix only has 382 transitions (discarded 179 similar events)
[2024-05-22 17:15:16] [INFO ] Invariant cache hit.
[2024-05-22 17:15:16] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 2 (OVERLAPS) 382/463 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 5 (OVERLAPS) 1/464 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 7 (OVERLAPS) 0/464 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 559 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 124 constraints, problems are : Problem set: 0 solved, 559 unsolved in 15462 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 559/559 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 559 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 2 (OVERLAPS) 382/463 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 415/538 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 6 (OVERLAPS) 1/464 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 144/683 constraints. Problems are: Problem set: 0 solved, 559 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 683 constraints, problems are : Problem set: 0 solved, 559 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 559/559 constraints, Known Traps: 0/0 constraints]
After SMT, in 45972ms problems are : Problem set: 0 solved, 559 unsolved
Search for dead transitions found 0 dead transitions in 45978ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46331 ms. Remains : 82/82 places, 561/561 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 179 transitions
Reduce isomorphic transitions removed 179 transitions.
Iterating post reduction 0 with 179 rules applied. Total rules applied 179 place count 82 transition count 382
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 179 place count 82 transition count 375
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 193 place count 75 transition count 375
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 1 with 2 rules applied. Total rules applied 195 place count 74 transition count 374
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 74 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 197 place count 73 transition count 373
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 203 place count 73 transition count 373
Applied a total of 203 rules in 38 ms. Remains 73 /82 variables (removed 9) and now considering 373/561 (removed 188) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 373 rows 73 cols
[2024-05-22 17:16:02] [INFO ] Computed 1 invariants in 4 ms
[2024-05-22 17:16:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 17:16:02] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 17:16:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-22 17:16:02] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 17:16:02] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-22 17:16:02] [INFO ] After 12ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 17:16:02] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 17:16:02] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 318 ms.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DoubleLock-PT-p3s2-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 176 stable transitions
Graph (complete) has 1053 edges and 84 vertex of which 81 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Graph (complete) has 1053 edges and 84 vertex of which 81 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 19 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:16:02] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 81 cols
[2024-05-22 17:16:02] [INFO ] Computed 1 invariants in 5 ms
[2024-05-22 17:16:02] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-22 17:16:02] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:16:02] [INFO ] Invariant cache hit.
[2024-05-22 17:16:02] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:16:02] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2024-05-22 17:16:02] [INFO ] Redundant transitions in 16 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 17:16:02] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:16:02] [INFO ] Invariant cache hit.
[2024-05-22 17:16:02] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 13354 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43884ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43891ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44224 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-00
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 3 ms.
FORMULA DoubleLock-PT-p3s2-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLFireability-00 finished in 44496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(!p0) U (!p1&&X(G(!p2)))))))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 81 transition count 568
Applied a total of 3 rules in 4 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:16:47] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:16:47] [INFO ] Invariant cache hit.
[2024-05-22 17:16:47] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-22 17:16:47] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:16:47] [INFO ] Invariant cache hit.
[2024-05-22 17:16:47] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:16:47] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 566 sub problems to find dead transitions.
[2024-05-22 17:16:47] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:16:47] [INFO ] Invariant cache hit.
[2024-05-22 17:16:47] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 13215 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43692ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43704ms
Starting structural reductions in LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44020 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR p1 p2), (OR p1 p2), true, p0, p2, (OR p2 p1), p2]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-06
Product exploration explored 100000 steps with 1862 reset in 312 ms.
Product exploration explored 100000 steps with 1847 reset in 312 ms.
Computed a total of 7 stabilizing places and 176 stable transitions
Computed a total of 7 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 107 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter sensitive) to 7 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(OR p1 p2), (OR p1 p2), true, p0, p2, (OR p2 p1), p2]
Reduction of identical properties reduced properties to check from 14 to 11
RANDOM walk for 40011 steps (463 resets) in 274 ms. (145 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40003 steps (96 resets) in 211 ms. (188 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (105 resets) in 154 ms. (258 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (108 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (101 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
[2024-05-22 17:17:32] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:17:32] [INFO ] Invariant cache hit.
[2024-05-22 17:17:32] [INFO ] State equation strengthened by 41 read => feed constraints.
Problem apf1 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 149/162 variables, 13/14 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 2/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem apf6 is UNSAT
Problem apf7 is UNSAT
After SMT solving in domain Real declared 467/470 variables, and 81 constraints, problems are : Problem set: 4 solved, 0 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 78/81 constraints, ReadFeed: 2/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 176ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (G (OR (NOT p0) (NOT p2))), (G (OR (NOT p0) p1)), (G (OR p0 (NOT p1) (NOT p2))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F p2), (F (NOT (OR p0 p1 (NOT p2)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p0) p2)))
Knowledge based reduction with 26 factoid took 157 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DoubleLock-PT-p3s2-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DoubleLock-PT-p3s2-LTLFireability-06 finished in 46120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Graph (complete) has 1053 edges and 84 vertex of which 81 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:17:33] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:17:33] [INFO ] Invariant cache hit.
[2024-05-22 17:17:33] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 17:17:33] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:17:33] [INFO ] Invariant cache hit.
[2024-05-22 17:17:33] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:17:33] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2024-05-22 17:17:33] [INFO ] Redundant transitions in 6 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 17:17:33] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:17:33] [INFO ] Invariant cache hit.
[2024-05-22 17:17:33] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 13525 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 44006ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 44012ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44312 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-07
Product exploration explored 100000 steps with 1878 reset in 234 ms.
Product exploration explored 100000 steps with 1867 reset in 259 ms.
Computed a total of 7 stabilizing places and 176 stable transitions
Computed a total of 7 stabilizing places and 176 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 31190 steps (352 resets) in 106 ms. (291 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 568/568 transitions.
Applied a total of 0 rules in 8 ms. Remains 81 /81 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:18:18] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:18:18] [INFO ] Invariant cache hit.
[2024-05-22 17:18:18] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-22 17:18:18] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:18:18] [INFO ] Invariant cache hit.
[2024-05-22 17:18:18] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:18:18] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-05-22 17:18:18] [INFO ] Redundant transitions in 3 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 17:18:18] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:18:18] [INFO ] Invariant cache hit.
[2024-05-22 17:18:18] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 13776 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 44231ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 44237ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44555 ms. Remains : 81/81 places, 568/568 transitions.
Computed a total of 7 stabilizing places and 176 stable transitions
Computed a total of 7 stabilizing places and 176 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 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 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40006 steps (455 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30120 steps (66 resets) in 20 ms. (1434 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 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 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1895 reset in 198 ms.
Product exploration explored 100000 steps with 1867 reset in 207 ms.
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 568/568 transitions.
Applied a total of 0 rules in 7 ms. Remains 81 /81 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:19:03] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:19:03] [INFO ] Invariant cache hit.
[2024-05-22 17:19:04] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 17:19:04] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:19:04] [INFO ] Invariant cache hit.
[2024-05-22 17:19:04] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:19:04] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2024-05-22 17:19:04] [INFO ] Redundant transitions in 6 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 17:19:04] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:19:04] [INFO ] Invariant cache hit.
[2024-05-22 17:19:04] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 12906 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 29903 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43221ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43228ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43537 ms. Remains : 81/81 places, 568/568 transitions.
Treatment of property DoubleLock-PT-p3s2-LTLFireability-07 finished in 134424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Graph (complete) has 1053 edges and 84 vertex of which 81 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:19:47] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:19:47] [INFO ] Invariant cache hit.
[2024-05-22 17:19:47] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-22 17:19:47] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:19:47] [INFO ] Invariant cache hit.
[2024-05-22 17:19:47] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:19:48] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2024-05-22 17:19:48] [INFO ] Redundant transitions in 5 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 17:19:48] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:19:48] [INFO ] Invariant cache hit.
[2024-05-22 17:19:48] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 13010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43434ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43439ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43914 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-08
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p3s2-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLFireability-08 finished in 43965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&X(X(X(p1)))))||X(X(!p0))))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 81 transition count 568
Applied a total of 3 rules in 4 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:20:31] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:20:31] [INFO ] Invariant cache hit.
[2024-05-22 17:20:31] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-22 17:20:31] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:20:31] [INFO ] Invariant cache hit.
[2024-05-22 17:20:31] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:20:31] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 566 sub problems to find dead transitions.
[2024-05-22 17:20:31] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:20:31] [INFO ] Invariant cache hit.
[2024-05-22 17:20:31] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 13154 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43586ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43594ms
Starting structural reductions in LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43869 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 220 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 137 ms.
Product exploration explored 100000 steps with 33333 reset in 122 ms.
Computed a total of 7 stabilizing places and 176 stable transitions
Computed a total of 7 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleLock-PT-p3s2-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleLock-PT-p3s2-LTLFireability-10 finished in 44394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Graph (complete) has 1053 edges and 84 vertex of which 82 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 82 /84 variables (removed 2) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:21:15] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 82 cols
[2024-05-22 17:21:15] [INFO ] Computed 1 invariants in 4 ms
[2024-05-22 17:21:16] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-22 17:21:16] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:21:16] [INFO ] Invariant cache hit.
[2024-05-22 17:21:16] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:21:16] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2024-05-22 17:21:16] [INFO ] Redundant transitions in 2 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-22 17:21:16] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:21:16] [INFO ] Invariant cache hit.
[2024-05-22 17:21:16] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 1/471 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 566 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 7 (OVERLAPS) 0/471 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 124 constraints, problems are : Problem set: 0 solved, 566 unsolved in 16619 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 421/544 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 1/471 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 145/690 constraints. Problems are: Problem set: 0 solved, 566 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/471 variables, and 690 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 47039ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 47045ms
Starting structural reductions in SI_LTL mode, iteration 1 : 82/84 places, 568/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47338 ms. Remains : 82/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-12
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p3s2-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLFireability-12 finished in 47393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(p0))))&&F(p1)))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 81 transition count 568
Applied a total of 3 rules in 5 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:22:03] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
// Phase 1: matrix 389 rows 81 cols
[2024-05-22 17:22:03] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 17:22:03] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-22 17:22:03] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:22:03] [INFO ] Invariant cache hit.
[2024-05-22 17:22:03] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:22:03] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 566 sub problems to find dead transitions.
[2024-05-22 17:22:03] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:22:03] [INFO ] Invariant cache hit.
[2024-05-22 17:22:03] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 13291 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43734ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43742ms
Starting structural reductions in LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44015 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-13
Entered a terminal (fully accepting) state of product in 4957 steps with 91 reset in 11 ms.
FORMULA DoubleLock-PT-p3s2-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLFireability-13 finished in 44231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||X(X(G(p1)))))))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 81 transition count 568
Applied a total of 3 rules in 3 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:22:47] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:22:47] [INFO ] Invariant cache hit.
[2024-05-22 17:22:47] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-22 17:22:47] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:22:47] [INFO ] Invariant cache hit.
[2024-05-22 17:22:47] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:22:47] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 566 sub problems to find dead transitions.
[2024-05-22 17:22:47] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:22:47] [INFO ] Invariant cache hit.
[2024-05-22 17:22:47] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 13123 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43555ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43563ms
Starting structural reductions in LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43879 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-14
Stuttering criterion allowed to conclude after 5554 steps with 101 reset in 16 ms.
FORMULA DoubleLock-PT-p3s2-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLFireability-14 finished in 44155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 568/568 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 81 transition count 568
Applied a total of 3 rules in 3 ms. Remains 81 /84 variables (removed 3) and now considering 568/568 (removed 0) transitions.
[2024-05-22 17:23:31] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:23:31] [INFO ] Invariant cache hit.
[2024-05-22 17:23:31] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-22 17:23:31] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:23:31] [INFO ] Invariant cache hit.
[2024-05-22 17:23:31] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:23:31] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 566 sub problems to find dead transitions.
[2024-05-22 17:23:32] [INFO ] Flow matrix only has 389 transitions (discarded 179 similar events)
[2024-05-22 17:23:32] [INFO ] Invariant cache hit.
[2024-05-22 17:23:32] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 123 constraints, problems are : Problem set: 0 solved, 566 unsolved in 12958 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 389/470 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 566/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 566 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 689 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 43375ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 43382ms
Starting structural reductions in LTL mode, iteration 1 : 81/84 places, 568/568 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43667 ms. Remains : 81/84 places, 568/568 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s2-LTLFireability-15
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p3s2-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s2-LTLFireability-15 finished in 43895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-22 17:24:15] [INFO ] Flatten gal took : 30 ms
[2024-05-22 17:24:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-22 17:24:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 84 places, 568 transitions and 2254 arcs took 13 ms.
Total runtime 602527 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DoubleLock-PT-p3s2

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 84
TRANSITIONS: 568
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.012s, Sys 0.000s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1152
MODEL NAME: /home/mcc/execution/410/model
84 places, 568 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716399451116

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleLock-PT-p3s2"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DoubleLock-PT-p3s2, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tall-171631131500636"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p3s2.tgz
mv DoubleLock-PT-p3s2 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;